Abstract

A class of binary sequences, constrained with respect to the length of zero runs, is considered. For such sequences, termed (d, k)-sequences, new combinatorial and computational results are established. Explicit expressions for enumerating (d, k)-sequences of finite length are obtained. Efficient computational procedures for calculating the capacity of a (d, k)-code are given. A simple method for constructing a near-optimal (d, k)-code is proposed. Illustrative numerical examples demonstrate further the theoretical results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call