Abstract
In this correspondence, we describe a heuristic method for the construction of linear codes with given parameters n, k, q, and prescribed minimum distance of at least . Our approach is based on a function estimating the probability that a code of dimension and blocklength over is extendable to a code with the given properties. Combining this evaluation function with a search algorithm, we were able to improve 40 entries in the international tables for the best known minimum distance in the cases and found at least two new optimal 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.
