The complexity of decoders--II: Computational work and decoding time
From MaRDI portal
Publication:5630986
DOI10.1109/TIT.1971.1054578zbMath0224.94022MaRDI QIDQ5630986
Publication date: 1971
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
The complexity of error-correcting codes, Fast message authentication using efficient polynomial evaluation, A note on performance of generalized tail biting trellis codes, A survey of constructive coding theory, and a table of binary codes of highest known rate, Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes