Title :
Balanced Maximum Counting Sequences
Author :
Suparta, I. Nengah ; Van Zanten, Arend Jan
Author_Institution :
Dept. of Math. Educ., IKIP Negeri Singaraja, Bali
Abstract :
In this correspondence, we discuss a modified version of a method due to Bakos and, independently, to Robinson and Cohn for the construction of Gray sequences. We make use of this construction to prove the existence of so-called balanced cyclic half Gray sequences. Furthermore, we discuss a specific type of counting sequences, called maximum counting sequences, and we prove a conjecture of Robinson and Cohn with respect to the existence of balanced maximum counting sequences
Keywords :
binary sequences; cyclic codes; Gray sequence; Robinson- and-Cohn conjecture; balanced maximum counting sequence; Application software; Computer science; Computer science education; Hamming distance; Mathematics; Reflective binary codes; Balanced counting sequences; Gray sequences; counting sequences; maximum counting sequences;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.878217
