The separability of standard cyclic N-ary Gray codes
نویسندگان
چکیده
A Sharp lower bound is derived for the cyclic list distance between two codewords, having Hamming distance , in the standard -ary Gray code of length , for 1 and for even values of . The bound generalizes a similar result in the binary case.
منابع مشابه
Balancing Cyclic R-ary Gray Codes
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R − 1} for all R,n ≥ 2. These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For every n ≥ 2, the number of occurrences of each digit in the n-digit codes is within R-1 of the average Rn/n, and for the 2-digit codes every transition count is either bR2/2c or dR2/2e.
متن کاملBalancing Cyclic R-ary Gray Codes II
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R − 1} for all R ≥ 2, n ≥ 3. These codes have the property that the distribution of digit changes (transition counts) between two successive elements is close to uniform. For R = 2, the construction and proof are simpler than earlier balanced cyclic binary Gray codes. For R ≥ 3 and n ≥ 2, every transition count is within 2 of the...
متن کاملCyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$
Let p be a prime number. In this paper, we study cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes. We obtain all except one ternary optimal code of length 12 as the Gray image of the cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We also characterize the p-ary...
متن کاملGray Codes for Torus and Edge Disjoint Hamiltonian Cycles
Lee distance Gray codes for k-ary n-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamiltonian cycles for a class of k-ary n-cubes, 2-D tori, and hypercubes.
متن کاملEfficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless algorithm [Inform. Process. Lett. 70 (1999) 7] to generate Gray codes for k-ary trees. In this paper, another loopless algorithm is presented to list Gray codes for k-ary trees more efficiently in both space and time th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003