Abstract:
In this paper, we construct two families Cm∗ and \tilde{C}m∗ of ternary (2m, 3m, 2m−1) and (2m, 3m+1, 2m−) codes, for m = 1, 2, 3, …, derived from the corresponding fam...Show MoreMetadata
Abstract:
In this paper, we construct two families Cm∗ and \tilde{C}m∗ of ternary (2m, 3m, 2m−1) and (2m, 3m+1, 2m−) codes, for m = 1, 2, 3, …, 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.
Published in: Journal of Communications and Networks ( Volume: 13, Issue: 1, February 2011)