Abstract

Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight d2(n,k) among all binary LCD [n,k] codes and the largest minimum weight d3(n,k) among all ternary LCD [n,k] codes. The largest minimum weights d2(n,5) and d3(n,4) are partially determined. We also determine the largest minimum weights d2(n,n−5), d3(n,n−i) for i∈{2,3,4}, and d3(n,k) for n∈{11,12,…,19}.

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 call

Disclaimer: 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.