Abstract
Certain properties of the parity-check matrix H of (n, k) linear codes are used to establish a computerised search procedure for new binary linear codes. Of the new error-correcting codes found by this procedure, two codes were capable of correcting up to two errors, three codes up to three errors, four codes up to four errors and one code up to five errors. Two meet the lower bound given by Helgert and Stinaff, and seven codes exceed it. In addition, one meets the upper bound. Of the even-Hamming-distance versions of these codes, eight meet the upper bound, and the remaining two exceed the lower bound.
Full Text
Published Version
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