Some new results for optimal ternary linear codes

Abstract

Let ( ) be the maximum possible minimum Hamming distance of a ternary [ ]-code for given values of and . We describe a package for code extension and use this to prove some new exact values of ( ). Moreover, we classify the ternary [ ( )]-codes for some values of and . 
DOI: 10.1109/18.992814

2 Figures and Tables

Topics

  • Presentations referencing similar topics