International Journal of Mathematics and Mathematical Sciences
Volume 29 (2002), Issue 5, Pages 265-270
doi:10.1155/S0161171202011444
A decoding scheme for the 4-ary lexicodes with D=3
D.G. Kim1
and H.K. Kim2
1Department of Internet and Computer, Chungwoon University, Chungnam, Hongsung 350-701, South Korea
2Department of Mathematics, Pohang University of Science and Technology, Pohang 790-784, South Korea
Abstract
We introduce the algorithms for basis and decoding of quaternary lexicographic codes with minimum distance d=3 for an arbitrary length n.