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

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

2009-06-12

arxiv.org/abs/0906.2372v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounds on the Rate of 2-D Bit-Stuffing Encoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds on the Rate of 2-D Bit-Stuffing Encoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Rate of 2-D Bit-Stuffing Encoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138590