Random codes: minimum distances and error exponents

DOI10.1109/TIT.2002.800480MaRDI QIDQ4677576zbMATH OpenFDO

Authors Alexander Barg, G. David jun. Forney

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.800480

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05)

Recommendations

• Estimates for distribution of the minimal distance of a random linear code
• Error Exponents of Typical Random Codes
• Distance Distribution of Binary Codes and the Error Probability of Decoding
• Bounds on distance distributions in codes of given size
• scientific article; zbMATH DE number 3340922
• On the minimum distance of combinatorial codes
• Minimum distances of error-correcting codes in incidence rings
• On the distance distribution of codes
• Reed-Muller codes for random erasures and errors
• Reed–Muller Codes for Random Erasures and Errors

Cited in

(27)

• Differential subordination and convexity criteria of integral operators
• Density of free modules over finite chain rings
• Syntactic structures and code parameters
• Asymptotic behaviour of codes in rank metric over finite fields
• Codes on s-periodic random error of length b
• A computability challenge: asymptotic bounds for error-correcting codes
• An efficient attack on all concrete KKS proposals
• Explicit rateless codes for memoryless binary-input output-symmetric channels
• Low-complexity cryptographic hash functions
• Randomness and structure in channel coding
• Tunstall Code, Khodak Variations, and Random Walks
• Reed-Muller Codes
• 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
• Correlated pseudorandomness from the hardness of quasi-abelian decoding
• Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
• Memoryless near-collisions via coding theory
• Asymptotically good generalized quasi-cyclic codes over finite chain rings
• Efficient error-correcting codes for the HQC post-quantum cryptosystem
• Information set decoding for ring-linear codes
• Density estimation using the perceptron
• Worst and average case hardness of decoding via smoothing bounds
• A toolbox for refined information-theoretic analyses
• Better bounds on the minimum Lee distance
• Can we speed up information set decoding by using extension field structure?
• On the high density behavior of Hamming codes with fixed minimum distance
• Random subcubes as a toy model for constraint satisfaction problems

This page was built for publication: Random codes: minimum distances and error exponents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677576)