Title :
The separability of standard cyclic N-ary Gray codes
Author :
van Zanten, A.J. ; Suparta, I. Nengah
Author_Institution :
Dept. of Math., Delft Univ. of Technol., Netherlands
Abstract :
A sharp lower bound is derived for the cyclic list distance between two codewords, having Hamming distance m, in the standard N-ary Gray code of length n, for 1≤m≤n and for even values of N. The bound generalizes a similar result in the binary case.
Keywords :
Gray codes; binary codes; cyclic codes; Hamming distance; binary Gray code; code length; code separability; codewords; cyclic N-ary Gray codes; cyclic list distance; sharp lower bound; Code standards; Hamming distance; Information technology; Mathematics; Reflective binary codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.807305
