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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
