A method for finding codewords of small weight
- First Online:
- Cite this paper as:
- Stern J. (1989) A method for finding codewords of small weight. In: Cohen G., Wolfmann J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg
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.