Abstract
The authors construct a (75,13,30) code and a (75,11,32) code. The minimum distances of these codes are one larger than the largest known (T. Verhoeff 1987) minimum distances of codes with the same length and dimension. As a (75,11,33) code does not exist, the (75,11,32) code is, in a sense, optimal. Both codes are obtained by judiciously shortening a (80,14,32) code that is obtained as a generalized concatenated code. >
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.
