Title :
On runlength codes
Author :
Zehavi, Ephraim ; Wolf, Jack K.
Author_Institution :
QUALCOMM Inc., San Diego, CA, USA
fDate :
1/1/1988 12:00:00 AM
Abstract :
Several results on binary (d, k) codes are given. First, a novel derivation for the capacity of these codes based on information-theoretic principles is given. Based on this result the spectrum of a (d, k) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the (d, k ) constraint is considered. Lower bounds on the capacity of such a channel are derived
Keywords :
binary sequences; channel capacity; codes; (d, k) code; binary codes; binary sequence; binary symmetric channel; channel capacity; information-theoretic principles; runlength codes; Binary sequences; Capacity planning; Digital recording; Information rates; Information theory; Interference constraints; Intersymbol interference; Magnetic recording; Postal services; Random variables;
Journal_Title :
Information Theory, IEEE Transactions on
