On codes with local joint constraints

DOI10.1016/J.LAA.2006.11.002zbMATH Open1180.68207OpenAlexW2148262447MaRDI QIDQ874995FDOQ874995

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

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

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)

Cites Work

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

Cited In (7)

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

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)