Asymptotic Analysis of Probabilistic Algorithms for Finding Short Codewords
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A method for finding codewords of small weightPublished by Springer Nature ,2005
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- An Observation on the Security of McEliece’s Public-Key CryptosystemPublished by Springer Nature ,1988
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- Limit distribution of the minimum distance of random linear codesIEEE Transactions on Information Theory, 1967