List decoding

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

On the Block Error Probability of LP Decoding of LDPC Codes

Abstract: In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar results for linear programming decoding of regular low-density parity-check codes.

Performance of joint maximum-likelihood decoding for block coded signal streams in overloaded MIMO-OFDM system

Abstract: This paper presents a joint decoding scheme for block coded signals in an overloaded multiple-input multiple-output (MIMO)-OFDM system. In a normal MIMO-OFDM system, symbol detection is carried out over the signals received by multiple antenna elements and is separated from decoding. However, owing to form factor limitation, a mobile terminal may have a limited number of receive antenna elements. Instead of splitting detection and decoding, in this paper, a joint maximum likelihood (ML) decoding in an overloaded MIMO-OFDM system is investigated. Based on ideal interleaving, independence among coded symbols spread over subcarriers is assumed. Thus, the outage capacity improves even though the ergodic capacity remains the same with a single receive antenna. As an example of the proposed system, bit error rate performance of Hamming coded and spatially multiplexed signals with joint ML decoding on a Rayleigh fading channel is investigated. The error rate is evaluated through analysis and computer simulation.

On the Optimality of Lattice Coding and Decoding in Multiple Access Channels

Abstract: In this paper, we consider a class of multiple access lattice space-time coding and decoding schemes. We prove an extended version of the Minkowski-Hlawka theorem, utilizing independent Loeliger ensembles. Applying this extension, we prove that lattice coding and decoding achieves the optimal diversity-multiplexing tradeoff of multiple access channels.

Enhanced decoding of interleaved error correcting codes

Abstract: A common way to deal with bursts in data storage systems is to interleave byte-error correcting codes. In the decoding of each of these byte-error correcting codes, one normally does not make use of the information obtained from the previous or subsequent code, while the bursty character of the channel indicates a dependency. Berlekamp and Tong (1985) exploited such a dependency to enhance the decoding performance. Here a different, but similar approach is proposed.

Low-complexity trellis decoding of linear block codes

Abstract: The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to the trellises of coset codes and allow low complexity soft maximum likelihood decoding.