Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Optimal Ternary \( (11,7 )\) and \(( 14,10) \) Error-Correcting Codes

Michael J.Letourneau1, Sheridan K.Houghtent2
1School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada
2Department of Computer Science Brock University Ontario, Canada
  • Published: 30/11/2004

Abstract

We use exhaustive computer searches to show that there are exactly \( 36 \) codewords in an optimal ternary \( (11,7) \) code and exactly \( 13 \) codewords in an optimal ternary \( (14,10) \) code. We also enumerate inequivalent optimal ternary \( (14,10) \) codes and show that there are exactly \( 6151 \) such codes.

Citation
Michael J.Letourneau, Sheridan K.Houghtent. Optimal Ternary \( (11,7 )\) and \(( 14,10) \) Error-Correcting Codes[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 051. 159-164. .