Improved Bit-Stuffing Bounds on Two-Dimensional Constraints

DOI10.1109/TIT.2004.826633MaRDI QIDQ3546974zbMATH OpenOpenAlexFDO

Authors Shirley Halevy, Jiangxin Chen, Ron M. Roth, Jack Keil Wolf, Paul Siegel

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2004.826633

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Recommendations

• Bounds on the Rate of 2-D Bit-Stuffing Encoders
• Bounds on the capacity of constrained two-dimensional codes
• Efficient code constructions for certain two-dimensional constraints
• Two-dimensional weight-constrained codes through enumeration bounds
• scientific article; zbMATH DE number 1756448
• Improved Semidefinite Programming Bound on Sizes of Codes
• Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
• Sharpening constraint programming approaches for bit-vector theory

Cited in

(9)

• Bounds on the capacity of constrained two-dimensional codes
• An Improvement to the Bit Stuffing Algorithm
• Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
• Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints
• Efficient coding schemes for the hard-square model
• scientific article; zbMATH DE number 2135156 (Why is no real title available?)
• Entropy bounds for constrained two-dimensional random fields
• New Bounds on the Capacity of Multidimensional Run-Length Constraints
• Bounds and constructions for TWOOAs

This page was built for publication: Improved Bit-Stuffing Bounds on Two-Dimensional Constraints

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