Bounds on the Rate of 2-D Bit-Stuffing Encoders

DOI10.1109/TIT.2010.2046242zbMATH Open1366.94324arXiv0906.2372OpenAlexW2127509807MaRDI QIDQ5281433FDOQ5281433

Authors: Ido Tal, Ron M. Roth 

Publication date: 27 July 2017

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

Abstract: A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasi-stationary. We use the quasi-stationary property in order to formulate linear requirements that must hold on the probabilities of the constrained arrays that are generated by the encoder. These requirements are used as part of a linear program. The minimum and maximum of the linear program bound the rate of the encoder from below and from above, respectively. A lower bound on the rate of an encoder is also a lower bound on the capacity of the corresponding constraint. For some constraints, our results lead to tighter lower bounds than what was previously known.

Full work available at URL: https://arxiv.org/abs/0906.2372

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (5)

• Recoding-derived bounds for input encoding
• Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
• Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
• Capacity of higher-dimensional constrained systems
• Bounds for Robust Metering Schemes and Their Relationship with A2-code

This page was built for publication: Bounds on the Rate of 2-D Bit-Stuffing Encoders

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