A method for finding codewords of small weight. (English) Zbl 0678.94006
Coding theory and applications, Proc. 3rd Int. Colloq., Toulon/France 1988, Lect. Notes Comput. Sci. 388, 106-113 (1989).
Summary: [For the entire collection see Zbl 0676.00026.]
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.
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.
MSC:
| 94A60 | Cryptography |
