On codes that avoid specified differences

DOI10.1109/18.904557zbMath0998.94563MaRDI QIDQ4544492

Bruce Moision, Alon Orlitsky, Paul H. Siegel

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/964a9ac0c95441bf640ea8f42d4ba2465987efbe

zbMATH Keywords

capacity; joint spectral radius; magnetic recording; constrained coding

Mathematics Subject Classification ID

94B65: Bounds on codes

Related Items

Continuity properties of the lower spectral radius, Stability of Linear Problems: Joint Spectral Radius of Sets of Matrices, Criteria for the stability of the finiteness property and for the uniqueness of Barabanov norms, An experimental study of approximation algorithms for the joint spectral radius, A rapidly-converging lower bound for the joint spectral radius via multiplicative ergodic theory, An explicit counterexample to the Lagarias-Wang finiteness conjecture, The generalised Berger-Wang formula and the spectral radius of linear cocycles, A Gel'fand-type spectral radius formula and stability of linear constrained switching systems, On codes with local joint constraints, Matrix products with constraints on the sliding block relative frequencies of different factors, Periodically switched stability induces exponential stability of discrete-time linear switched systems in the sense of Markovian probabilities, Tight bound for deciding convergence of consensus systems, On the finiteness property for rational matrices, Efficient algorithms for deciding the type of growth of products of integer matrices, Optimal norms and the computation of joint spectral radius of matrices