Abstract
The minimum distance of all binary cyclic codes of length 151 is determined. Almost all of these cyclic codes have the same parameters as the best linear codes given in Brouwer's database. A nested chain of linear codes is derived from these cyclic codes and some new binary codes are obtained by applying Constructions X and XX to pairs of codes in this chain. Good candidates for nested codes can also be obtained by enlarging the cyclic codes of high minimum distance. In total, there are 39 new binary linear codes that have a minimum distance higher than codes previously considered to be the best linear 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.
