The complexity of decoders--II: Computational work and decoding time

DOI10.1109/TIT.1971.1054578MaRDI QIDQ5630986zbMATH OpenFDO

Authors John Savage

Publication date 1971

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

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

Mathematics Subject Classification ID

Rate-distortion theory in information and communication theory (94A34) Decoding (94B35)

Cited in

(5)

• A survey of constructive coding theory, and a table of binary codes of highest known rate
• A note on performance of generalized tail biting trellis codes
• Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
• Fast message authentication using efficient polynomial evaluation
• The complexity of error-correcting codes

This page was built for publication: The complexity of decoders--II: Computational work and decoding time

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