Abstract

Using the properties of parity-check matrices of binary linear codes a tree-search program is given which finds quasi-perfect codes. Fixing the number of check digits and the number of errors to be corrected, the program will find one quasi-perfect code for each block length that such a code exists. The efficiency of the search technique is demonstrated by the fact that the program yielded eighteen new quasi-perfect double error-correcting codes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call