On codes with local joint constraints

DOI10.1016/J.LAA.2006.11.002MaRDI QIDQ874995zbMATH OpenOpenAlexFDO

Authors Bruce Moision, Alon Orlitsky, Paul Siegel

Publication date 10 April 2007

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2006.11.002

zbMATH Keywords

joint spectral radiusinformation capacitygeneralized spectral radiusforbidden words

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Combinatorics on words (68R15)

Recommendations

• On codes that avoid specified differences
• On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
• Bounds on the capacity of constrained two-dimensional codes
• On runlength codes
• Codes and local constraints

Cites work

• scientific article; zbMATH DE number 3155071 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 1284433 (Why is no real title available?)
• An efficient lower bound for the generalized spectral radius of a set of matrices
• Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
• Bounded semigroups of matrices
• Codes for digital recorders
• Coding for multitrack magnetic recording systems
• Coding for two-head recording systems
• Computing the joint spectral radius
• Lyapunov indicator of discrete inclusions. I
• On codes that avoid specified differences
• Sets of matrices all infinite products of which converge
• Stability of discrete linear inclusion
• The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
• The boundedness of all products of a pair of matrices is undecidable
• The characterization of continuous, four-coefficient scaling functions and wavelets
• The finiteness conjecture for the generalized spectral radius of a set of matrices
• Two-Scale Difference Equations II. Local Regularity, Infinite Products of Matrices and Fractals

Cited in

(7)

• Codes and local constraints
• On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
• A characterization of the generalized spectral radius with Kronecker powers
• On codes that avoid specified differences
• Efficient algorithms for deciding the type of growth of products of integer matrices
• On the continuity of the generalized spectral radius in max algebra
• On the finiteness property for rational matrices

This page was built for publication: On codes with local joint constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874995)