Any code of which we cannot think is good

DOI10.1109/18.59944MaRDI QIDQ3199328zbMATH OpenOpenAlexFDO

Authors John T. Coffey, Rodney M. Goodman

Publication date 1990

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

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

zbMATH Keywords

block lengthcoding theorydistance versus reduncancyGilbert-Varshamov boundKolmogorov complexitylinear coderandom nonlinear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Randomness and structure in channel coding
• Limits to List Decoding Random Codes
• scientific article; zbMATH DE number 4102986
• scientific article; zbMATH DE number 726918
• scientific article; zbMATH DE number 6103506

Cited in

(14)

• Information compression and Varshamov-Gilbert bound
• Differential subordination and convexity criteria of integral operators
• Individual codewords
• Syntactic structures and code parameters
• Kolmogorov complexity and the asymptotic bound for error-correcting codes
• scientific article; zbMATH DE number 3861050 (Why is no real title available?)
• Some optimal codes have structure
• Coding Strings by Pairs of Strings
• scientific article; zbMATH DE number 4102986 (Why is no real title available?)
• Algorithmic complexity of points in dynamical systems
• scientific article; zbMATH DE number 726918 (Why is no real title available?)
• The empirical distribution of good codes
• Randomness and structure in channel coding
• Are binary codings universal?

This page was built for publication: Any code of which we cannot think is good

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