Title :
Maximizing the capacity of constrained systems that forbid two sequences
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA
Abstract :
We solve the problem of finding the set {A, B} ⊂ {0, 1}m that maximizes, among all 2-subsets of {0, 1}m, the Shannon capacity, H(A, B), of a constrained system of binary sequences that do not contain A or B as a contiguous subsequence.
Keywords :
binary sequences; channel capacity; optimisation; set theory; Shannon capacity; binary sequences; constrained systems capacity maximization; input constrained channel coding; set theory; Binary sequences; Displays; Entropy; Polynomials;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023627
