List decoding

About: List decoding is a research topic. Over the lifetime, 7251 publications have been published within this topic receiving 151182 citations.

Mobile radio data transmission—Coding for error control

Abstract: Error patterns recorded during mobile radio data transmission experiments in London have been used to assess what error control strategies are required to achieve reliable data communication. The performance of error detecting and correcting codes has been investigated and the effects of varying code parameters explored. Results are given for transmission at 462 MHz using data rates of 1200 b/s and 4800 b/s, and the advantages of using a high data rate are considered. Bit interleaving is shown to be a useful way of dispersing bursts of errors, greatly improving the performance of an error correcting code. Fairly simple coding techniques can give a performance which is adequate for many applications, and a high performance is readily possible.

Stationary queue-size distribution for variable complexity sequential decoders with large timeout

Abstract: Fano decoders are convolutional channel decoders having variable decoding complexity in changing channel conditions. Buffers are usually required by the Fano decoder to store data blocks due to non-deterministic decoding delays. In practice, however, a predetermined limit is typically set for the decoding time so that the Fano decoder is not allowed to devote more time than the limit in decoding any single data block. We assume that data blocks arrive to the decoder with an infinite buffer according to a Bernoulli process, and that the decoding time of the Fano decoder follows the Pareto distribution parameterized by the signal-to-noise ratio (SNR) of the channel. If the channel has a smaller SNR, it typically takes longer time to decode a nosier data block. It is known in theory that if the SNR is lower than a certain threshold, the variance of the decoding time can go to infinity. In practice, if the decoding time of a block exceeds this limit, the block is removed from the buffer, resulting in a failure in decoding. In this paper, we present a method to obtain the stationary queue size distribution numerically for large decoding time limits.

List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques

Abstract: A new interpolation-based decoding principle for interleaved Gabidulin codes is presented. The approach consists of two steps: First, a multi-variate linearized polynomial is constructed which interpolates the coefficients of the received word and second, the roots of this polynomial have to be found. Due to the specific structure of the interpolation polynomial, both steps (interpolation and root-finding) can be accomplished by solving a linear system of equations. This decoding principle can be applied as a list decoding algorithm (where the list size is not necessarily bounded polynomially) as well as an efficient probabilistic unique decoding algorithm. For the unique decoder, we show a connection to known unique decoding approaches and give an upper bound on the failure probability. Finally, we generalize our approach to incorporate not only errors, but also row and column erasures.

High-speed decoding of BCH codes (Corresp.)

Abstract: A general algorithm is derived for the calculation of the error location polynomial in decoding a Bose-Chaudhuri-Hocquenguem (BCH) code. A shorter decoding time is required by the algorithm for low-weight errors because only a subset of the syndrome equations are to be satisfied. The application of the general algorithm to Berlekamp's algorithm is also presented.

Performance of concatenated Reed-Solomon/convolutional codes with iterative decoding

Abstract: The concatenated coding scheme using convolutional coding with Viterbi decoding for inner code and Reed-Solomon (RS) code for the outer code is an attractive scheme used in a wide range of digital transmission systems. In this paper, we present some results on the iterative decoding of this concatenated coding scheme. This iterative decoding algorithm combines the iterative decoding algorithm for a block turbo code and the iterative decoding algorithm for a convolutional turbo code. The iterative decoding of the concatenated RS/convolutional coding scheme is based on the soft decoding and the soft decision of the component codes. The performance of the iterative decoding of those concatenated codes has been evaluated on the Gaussian channel using Monte Carlo simulation. Coding gains up to 7.1 dB for a BER (bit error rate) of 10/sup -5/ have been obtained on the Gaussian channel.