Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

DOI10.1109/TIT.2007.892781MaRDI QIDQ3548263zbMATH OpenOpenAlexFDO

Authors Søren Forchhammer, T. V. Laursen

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.2007.892781

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
• Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
• Asymptotic capacity of two-dimensional channels with checkerboard constraints
• Entropy bounds for constrained two-dimensional random fields
• The capacity and coding gain of certain checkerboard codes

Cited in

(2)

• Asymptotic capacity of two-dimensional channels with checkerboard constraints
• Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions

This page was built for publication: Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

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