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 511
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (1), 367-378
- https://doi.org/10.1109/18.651067
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystemsIEEE Transactions on Information Theory, 1994
- Idempotents and the BCH boundIEEE Transactions on Information Theory, 1994
- On insecurity of cryptosystems based on generalized Reed-Solomon codesDiscrete Mathematics and Applications, 1992
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- Cryptanalysis: a survey of recent resultsProceedings of the IEEE, 1988
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- Shortened BCH codes (Corresp.)IEEE Transactions on Information Theory, 1973
- Iterative decoding of linear codes by a modulo-2 linear programDiscrete Mathematics, 1972
- Some results on the minimum weight of primitive BCH codes (Corresp.)IEEE Transactions on Information Theory, 1972
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH CodesIEEE Transactions on Information Theory, 1969