Abstract
Let d_3(n,k) be the maximum possible minimum Hamming distance of a ternary [ n,k,d;3]-code for given values of n and k. It is proved that d_3(44,6)=27, d_3(76,6)=48,d_3(94,6)=60 , d_3(124,6)=81,d_3(130,6)=84 , d_3(134,6)=87,d_3(138,6)=90 , d_3(148,6)=96,d_3(152,6)=99 , d_3(156,6)=102,d_3(164,6)=108 , d_3(170,6)=111,d_3(179,6)=117 , d_3(188,6)=123,d_3(206,6)=135 , d_3(211,6)=138,d_3(224,6)=147 , d_3(228,6)=150,d_3(236,6)=156 , d_3(31,7)=17 andd_3(33,7)=18 . These results are obtained by a descent method for designing good 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.
