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
[...]
TL;DR: A new explicit error-correcting code based on Trevisan's extractor that can handle high-noise, almost-optimal rate list-decodable codes over large alphabets and soft decoding is proposed.
Abstract: We define new error correcting codes based on extractors. We show that for certain choices of parameters these codes have better list decoding properties than are known for other codes, and are provably better than Reed-Solomon codes. We further show that codes with strong list decoding properties are equivalent to slice extractors, a variant of extractors. We give an application of extractor codes to extracting many hardcore bits from a one-way function, using few auxiliary random bits. Finally, we show that explicit slice extractors for certain other parameters would yield optimal bipartite Ramsey graphs.
74 citations
TL;DR: A new algorithm called the slope control algorithm, capable of achieving a better throughput than the time-out algorithm, is proposed and verified by computer simulation for a binary symmetric channel.
Abstract: An important feature of ARQ sequential decoding is that a very low undetected error probability can be achieved without increasing significantly the complexity of decoding. Several ARQ sequential decoding algorithms based on the stack algorithm are considered. Analysis is done for a memoryless channel with noiseless feedback, and the emphasis is on evaluating the undetected error probability and the maximum throughput attainable with each algorithm. A time-out algorithm is analyzed and the parameters optimizing the performance of this algorithm are found. A new algorithm called the slope control algorithm, capable of achieving a better throughput than the time-out algorithm, is proposed. The algorithm is analyzed using random coding arguments, and the parameters maximizing the throughput for various conditions are found. All theoretical results are verified by computer simulation for a binary symmetric channel.
74 citations
16 Aug 1998
TL;DR: A class of convolutional codes defined by a low-density parity-check matrix and an iterative algorithm for the decoding of these codes is presented, and the performance is close to the performance of turbo-decoding.
Abstract: We present a class of convolutional codes defined by a low-density parity-check matrix, and an iterative algorithm for the decoding of these codes. The performance of this decoding is close to the performance of turbo-decoding.
74 citations
TL;DR: A low-complexity sequential soft decision decoding algorithm is proposed, based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.
Abstract: The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.
74 citations
Patent•
07 Dec 1998TL;DR: In this article, an iterative decoder performs decoding on a coded information signal based on minimum and maximum values for the number of decoding iterations to be performed for a particular data transmission.
Abstract: A method and apparatus for iterative decoding of a coded information signal that allows quality of service, QoS, parameters to be dynamically balanced in a telecommunications system. In an embodiment, an iterative decoder performs decoding on a coded information signal based on minimum and maximum values for the number of decoding iterations to be performed for a particular data transmission. The minimum and maximum values for the number of decoding iterations are determined according to QoS requirements that are given in terms of BER and Tdelay.
74 citations