Abstract
The diversity ( Φ 0 , Φ 1 ) of a ternary [ n , k , d ] code C with d ≡ 1 or 2 (mod 3), k ⩾ 3 , is defined by Φ 0 = 1 2 ∑ 3 | i , i ≠ 0 A i , Φ 1 = 1 2 ∑ i ≢ 0 , d ( mod 3 ) A i , where A i stands for the number of codewords with weight i. C is always extendable if ( Φ 0 , Φ 1 ) is one of four types (Extendability of ternary linear codes, Des. Codes Cryptogr., to appear). Using this property, we prove the nonexistence of ternary linear codes with parameters [ 69 , 6 , 44 ] , [ 81 , 6 , 52 ] , [ 108 , 6 , 70 ] , [ 157 , 6 , 103 ] , [ 256 , 6 , 169 ] , [ 257 , 6 , 170 ] , [ 269 , 6 , 178 ] .
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.
