Re-synchronization of permutation codes with Viterbi-like decoding

Abstract: In this paper, we present a fast re-synchronization algorithm for permutation coded sequences. The new algorithm combines the dynamic algorithm and a Viterbi-like decoding algorithm for trellis codes. The new algorithm has a polynomial time complexity O(N), where N denotes the length of the sequence. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered

Synchronization using insertion/deletion correcting permutation codes

Abstract: In this paper, we present a fast synchronization coding scheme, which uses single insertion/deletion error correcting permutation codes. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered. Compared to conventional timing recovery schemes, no redundancies for preamble sequences and no processing delays from decision devices are needed

Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel

The errors occurring in DNA-based storage are correlated in nature, which is a direct consequence of the synthesis and sequencing processes. In this paper, we consider the memory-$k$ nanopore channel model recently introduced by Hamoum et al., which models the inherent memory of the channel. We derive the maximum a posteriori (MAP) decoder for this channel model. The derived MAP decoder allows us to compute achievable information rates for the true DNA storage channel assuming a mismatched decoder matched to the memory-$k$ nanopore channel model, and quantify the loss in performance assuming a small memory length--and hence limited decoding complexity. Furthermore, the derived MAP decoder can be used to design error-correcting codes tailored to the DNA storage channel. We show that a concatenated coding scheme with an outer low-density parity-check code and an inner convolutional code yields excellent performance.Comment: This paper has been accepted and awaiting publication in informatio theory workshop (ITW) 202