Abstract:
Certain magnetic recording applications call for a large number of sequences whose differences do not include certain disallowed binary patterns. We show that the number ...Show MoreMetadata
Abstract:
Certain magnetic recording applications call for a large number of sequences whose differences do not include certain disallowed binary patterns. We show that the number of such sequences increases exponentially with their length and that the growth rate, or capacity, is the logarithm of the joint spectral radius of an appropriately defined set of matrices. We derive a new algorithm for determining the joint spectral radius of sets of nonnegative matrices and combine it with existing algorithms to determine the capacity of several sets of disallowed differences that arise in practice.
Published in: IEEE Transactions on Information Theory ( Volume: 47, Issue: 1, January 2001)
DOI: 10.1109/18.904557
Mathematical Sciences Research Center, Lucent Technologies, Inc., Murray Hill, NJ, USA
Communications Systems and Research Section, Jet Propulsion Laboratory, Pasadena, CA, USA
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA
Contents Mathematical Sciences Research Center, Lucent Technologies, Inc., Murray Hill, NJ, USA
Communications Systems and Research Section, Jet Propulsion Laboratory, Pasadena, CA, USA
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA
