Abstract
Let n 4( k, d) be the minimum length of a linear [ n, k, d] code over GF(4) for given values of k and d. For codes of dimension five, we compute the exact values of n 4(5, d) for 75 previously open cases. Additionally, we show that n 4(6,14)=24, n 4(7,9)=18, and n 4(7,10)=20. Moreover, we classify optimal quaternary codes for some values of n and k.
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.
