Analyzing the codes that avoid specified differences by binary tree
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
A bit-stuffing algorithm for crosstalk avoidance in high speed switching
INFOCOM'10 Proceedings of the 29th conference on Information communications
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
SIAM Journal on Matrix Analysis and Applications
An experimental study of approximation algorithms for the joint spectral radius
Numerical Algorithms
| Hi-index | 754.84 |
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