Abstract
We compute upper bounds on the maximal size of a binary linear code of length n 1000, dimension k, and distance d For each value of d, the bound is found by solving the Delsarte linear programming problem. Relying on the results of the calculations, we discuss the known bounds on the size of codes and some recent conjectures made about them. The most important conclusion is that Delsarte’s linear programming method is unlikely to yield major improvements of the known general upper bounds on the size of codes.
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.
