Endcoding Complexity Versus Minimum Distance

DOI10.1109/TIT.2005.847727zbMath1285.94028OpenAlexW2103897251MaRDI QIDQ3546546

Louay Bazzi, Sanjoy K. Mitter

Publication date: 21 December 2008

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

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

zbMATH Keywords

minimum distancebranching programstime-space tradeoffsBinary codesencoding complexity

Mathematics Subject Classification ID

Bounds on codes (94B65) Source coding (94A29)

Related Items (4)

Chaotic observer-based synchronization under information constraints ⋮ A note on the decoding complexity of error-correcting codes ⋮ Bounded Independence Plus Noise Fools Products ⋮ LDPC codes from Singer cycles

This page was built for publication: Endcoding Complexity Versus Minimum Distance