On the complexity of minimum distance decoding of long linear codes
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (5), 1392-1405
- https://doi.org/10.1109/18.771141
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Minimal vectors in linear codesIEEE Transactions on Information Theory, 1998
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- Suboptimal decoding of linear codes: partition techniqueIEEE Transactions on Information Theory, 1996
- The complexity of information set decodingIEEE Transactions on Information Theory, 1990
- A new approach to the general minimum distance decoding problem: The zero-neighbors algorithmIEEE Transactions on Information Theory, 1985
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)IEEE Transactions on Information Theory, 1982
- (n,k,t))-covering systems and error-trapping decoding (Corresp.)IEEE Transactions on Information Theory, 1981
- Decoding linear block codes for minimizing word error rate (Corresp.)IEEE Transactions on Information Theory, 1979
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- The use of information sets in decoding cyclic codesIEEE Transactions on Information Theory, 1962