Date: 14 Jun 2005

A method for finding codewords of small weight

* Final gross prices may vary according to local VAT.

Get Access


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.