The complexity of information set decoding
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (5) , 1031-1037
- https://doi.org/10.1109/18.57202
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Any code of which we cannot think is goodIEEE Transactions on Information Theory, 1990
- A new approach to the general minimum distance decoding problem: The zero-neighbors algorithmIEEE Transactions on Information Theory, 1985
- An error-trapping decoder for nonbinary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1984
- (n,k,t))-covering systems and error-trapping decoding (Corresp.)IEEE Transactions on Information Theory, 1981
- Error-Correction Coding for Digital CommunicationsPublished by Springer Nature ,1981
- On complete decoding of linear error-correcting codesInformation and Control, 1980
- On vote-taking and complete decoding of certain error-correcting codesInformation and Control, 1979
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Information-theoretic computation complexityIEEE Transactions on Information Theory, 1974
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972