• Journal of Communications and Networks
• /
• 제13권1호
• /
• pp.12-16
• /
• 2011

In this paper, we construct two families $C^*_m$ and ${\~{C}}^*_m$ of ternary ($2^m$, $3^m$, $2^{m-1}$ ) and ($2^m$, $3^{m+1}$, $2^{m-1}$ ) codes, for m = 1, 2, 3, ${\cdots}$, derived from the corresponding families of modified ternary Jacket matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.