The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint

DOI10.1016/j.disc.2018.11.014zbMath1441.05036OpenAlexW2906176719MaRDI QIDQ1727769

Mordecai J. Golin, Zhibing Chen, Xue-rong Yong

Publication date: 20 February 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.11.014

zbMATH Keywords

transfer matrixcapacityspectral radiusconstraintpower method

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The channel capacity of read/write isolated memory
• On the channel capacity of read/write isolated memory
• Principal submatrices. II: The upper and lower quadratic inequalities
• Matrix Analysis
• The Number of Independent Sets in a Grid Graph
• The capacity and coding gain of certain checkerboard codes
• On the capacity of two-dimensional run-length constrained channels
• Capacity bounds for the three-dimensional (0,1) run length limited channel
• Solution of the “Problème des ménages”
• Compression of transfer matrices

This page was built for publication: The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint