Topic
List decoding
About: List decoding is a research topic. Over the lifetime, 7251 publications have been published within this topic receiving 151182 citations.
Papers published on a yearly basis
Papers
More filters
Patent•
20 Jun 1980
TL;DR: In this paper, the decoding of the first stage is made to the 2nd error correction block, and the PCM data series of a plurality of channels and the 1st check word series are delayed for the different time from channel.
Abstract: PURPOSE: To prevent the mistake of the decoding error detection at the next stage, by adding the pointer indicating the decoding error of the 1st stage and discriminating the number of pointers within one block at the decoding of the next stage. CONSTITUTION: The decoding of the 1st stage is made to the 2nd error correction block, and the PCM data series of a plurality of channels and the 1st check word series are delayed for the different time from channel. After that, the decoding of the next stage is made to the 1st error correction block, and at the decoding of the 1st stage, the pointer representing the presence of error for every word is added according to the result of decoding relating to the 2nd error correction block. At the decoding of the next stage, if the number of pointers representing the error within the 1st error correction block exceeds a given number, when the result of discrimination for absence of errors is obtained through the decoding at the next stage, the pointer added at the decoding of the 1st stage is remained the same, allowing to avoid the missing of error detection. COPYRIGHT: (C)1982,JPO&Japio
39 citations
TL;DR: A general approach for constructing high-rate cycle codes having girth 12 which achieve the lower bound on the block length is presented and an efficient encoding algorithm is proposed for this class of codes.
Abstract: In this paper, we present a general approach for constructing high-rate cycle codes having girth 12 which achieve the lower bound on the block length. An efficient encoding algorithm is also proposed for this class of codes. We estimate the word error rate of the cycle codes for additive white Gaussian noise (AWGN) channels under maximum likelihood decoding, using the minimum distance and its multiplicity. These estimates are compared to simulation results with iterative soft decoding. The performance of these codes for partial response channels is studied under iterative soft decoding using computer simulations.
39 citations
01 Jan 2005
TL;DR: Simulation results indicate that the bounds are tight for small error rates, and the proposed codes have strong UEP property.
Abstract: A generalization of rateless codes (LT and Raptor codes) to provide unequal error protection (UEP) property is proposed in this paper. The proposed codes (UEP-LT and UEP-Raptor codes) are analyzed for the best possible performance over the binary erasure channel (BEC) in finite-length cases. We derive upper and lower bounds on the bit error probabilities under the maximum-likelihood (ML) decoding. We further verify our work with simulations. Simulation results indicate that the bounds are tight for small error rates, and the proposed codes have strong UEP property.
39 citations
TL;DR: It is shown how a polynomial representation of the modeling behavior gives rise to the bivariate interpolating polynomials of the Sudan-Guruswami approach to list decoding of Reed-Solomon codes.
Abstract: In this paper, the Sudan-Guruswami approach to list decoding of Reed-Solomon (RS) codes is cast in a system-theoretic framework. With the data, a set of trajectories or time series is associated which is then modeled as a so-called behavior. In this way, a connection is made with the behavioral approach to system theory. It is shown how a polynomial representation of the modeling behavior gives rise to the bivariate interpolating polynomials of the Sudan-Guruswami approach. The concept of "weighted row reduced" is introduced and used to achieve minimality. Two decoding methods are derived and a parametrization of all bivariate interpolating polynomials is given.
39 citations
TL;DR: In experiments using a single fiber between a transmitter and a receiver by orthogonal polarizations, delta -function inverse response was observed, and the ideal two-channel network with inverse decoding has no loss due to encoding/decoding, only inevitable lossDue to the broadcast network.
Abstract: Coherent fiber-optic networks are used to improve upon incoherent CDMA schemes. If a single-channel network is used between transmitters and receivers, standard coherent correlation takes place. If several parallel spatial channels (fibers and/or polarizations) are used, ideal inverse decoding can be implemented, with perfect delta -function response of the matched decoder. The two-channel case is studied in detail. The rules for finding inverses of a given coding network and the relationship between matched networks for one-channel decoding and two-channel inverse decoding are given. Phase and frequency differences among stations imply that unwanted signals add up incoherently. The ideal two-channel network with inverse decoding has no loss due to encoding/decoding, only inevitable loss due to the broadcast network. In experiments using a single fiber between a transmitter and a receiver by orthogonal polarizations, delta -function inverse response was observed. >
39 citations