Results 271 to 280 of about 19,174 (291)

On the List Decodability of Burst Errors

IEEE Transactions on Information Theory, 2016
Burst errors are a type of distortion in many data communications and data storage channels. In this paper, we consider the list decodability of codes for single burst error case and phased-burst error case independently. Firstly, we analyze the list decodability of random codes, and we show that the burst list decoding radius and the rate of random ...
openaire   +1 more source

List Decoding of Crisscross Errors

IEEE Transactions on Information Theory, 2017
In this paper, list decoding of crisscross errors in arrays over finite fields is considered. For this purpose, the so-called cover metric is used, where the cover of a matrix is a set of rows and columns which contains all non-zero elements of the matrix.
openaire   +1 more source

The Complexity of Local List Decoding

2008
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that computing majority over i¾?(1/i¾?) bits is essentially equivalent to locally list-decoding binary codes from relative distance 1/2 i¾?
Dan Gutfreund, Guy N. Rothblum
openaire   +2 more sources

List decoding with side information

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2004
Under list decoding of error-correcting codes, the decoding algorithm is allowed to output a small list of codewords that are close to the noisy received word. This relaxation permits recovery even under very high noise thresholds. We consider one possible scenario that would permit disambiguating between the elements of the list, namely where the ...
openaire   +1 more source

List Decoding and Pseudorandom Constructions

2007
There is a rich interplay between coding theory and computational complexity theory that has enriched both disciplines over the years. In particular, list decoding and closely related notions have been instrumental in several advances in explicit constructions of combinatorial objects with strong “random-like” properties, such as expander graphs ...
openaire   +1 more source

List-decoding multiplicity codes

Electron. Colloquium Comput. Complex., 2012
Summary: We study the list-decodability of multiplicity codes. These codes, which are based on evaluations of high-degree polynomials and their derivatives, have rate approaching \(1\) while simultaneously allowing for sublinear-time error correction.
openaire   +2 more sources

A Fast Polar Code List Decoder Architecture Based on Sphere Decoding

IEEE Transactions on Circuits and Systems I: Regular Papers, 2016
Seyyed Ali Hashemi, Carlo Condò, Warren J Gross   +2 more
exaly  

Low complexity list successive cancellation decoding of polar codes

IET Communications, 2014
Congzhe Cao, Zesong Fei, Jinhong Yuan
exaly  

LLR-Based Successive Cancellation List Decoding of Polar Codes

IEEE Transactions on Signal Processing, 2015
Alexios Balatsoukas-Stimming, Mani Bastani Parizi, Andreas Burg   +2 more
exaly  

Belief Propagation List Decoding of Polar Codes

IEEE Communications Letters, 2018
Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer   +2 more
exaly