A method for finding codewords of small weight
We describe a probabilistic algorithm, which can be used to discover words of small weight in a linear binary code. The work-factor of the algorithm is asymptotically quite large but the method can be applied for codes of a medium size. Typical instances that are investigated are codewords of weight 20 in a code of length 300 and dimension 150.
Unable to display preview. Download preview PDF.
- E.R.Berlekamp, R.J.Mc Eliece and H.C.A. Van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384–386.Google Scholar
- A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Proceedings of Crypto 86, Santa-Barbara (1986), 181–187.Google Scholar
- S. Harari, This volume.Google Scholar