On codes that avoid specified differences
Published • Nov 7, 2002
Authors:,,
B.E. Moision
A. Orlitsky
P. Siegel
Abstract
We study the number of binary sequences whose differences do not include certain disallowed patterns. We show that the number of such sequences increases exponentially with their length and that the exponent, or capacity, is the logarithm of the joint spectral radius of an appropriately defined set ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!