Random codes: minimum distances and error exponents
From MaRDI portal
Publication:4677576
DOI10.1109/TIT.2002.800480zbMath1062.94005MaRDI QIDQ4677576
Alexander Barg, G. David jun. Forney
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Linear codes (general theory) (94B05) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)
Related Items
Syntactic structures and code parameters, A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes, Density of free modules over finite chain rings, One more proof of the first linear programming bound for binary codes and two conjectures, Densities of codes of various linearity degrees in translation-invariant metric spaces, Differential subordination and convexity criteria of integral operators, Correlated pseudorandomness from the hardness of quasi-abelian decoding, Asymptotic behaviour of codes in rank metric over finite fields, Memoryless near-collisions via coding theory, Random subcubes as a toy model for constraint satisfaction problems, Unnamed Item, An Efficient Attack on All Concrete KKS Proposals, Unnamed Item, Reed-Muller Codes
