A decoding scheme for the 4-ary lexicodes with D=3
We introduce the algorithms for basis and decoding of quaternary lexicographic codes with minimum distance d=3 for an arbitrary length n.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2002-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171202011444 |