Computerised search for linear binary codes

Computerised search for linear binary codes

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A computerised search procedure is described for finding new binary codes The method involves the extension of a given known code by annexing a number of parity-check digits to it in such a way that the minimum Hamming distance of the given code is improved. A number of codes found by this procedure have better rates than the best known codes of identical Hamming distance and the same number of information digits; a table of these codes is presented.


    1. 1)
      • E.R. Berlekamp . (1984) , Algebraic coding theory.
    2. 2)
      • W.W. Peterson , E.J. Weldon . (1972) , Error-correcting codes.
    3. 3)
      • P.G. Farrell . Linear binary anticodes. Electron. Lett. , 419 - 421
    4. 4)
      • H.J. Helgert , R.D. Stinaff . Minimum-distance bounds for binary linear codes. IEEE Trans. , 344 - 356
    5. 5)
      • J.H. van Lint . (1971) , Coding theory.
    6. 6)
      • P.G. Farrell , A. Farrag . Further properties of linear binary anticodes. Electron. Lett. , 10 , 340 - 341

Related content

This is a required field
Please enter a valid email address