Computer Science – Information Theory
Scientific paper
2009-02-24
Computer Science
Information Theory
29 pages, submitted to IEEE Transactions on Information Theory. This paper is a corrected version of a paper with the same tit
Scientific paper
10.1109/TIT.2011.2145490
Constant-weight and constant-charge binary sequences with constrained run length of zeros are introduced. For these sequences, the weight and the charge distribution are found. Then, recurrent and direct formulas for calculating the number of these sequences are obtained. With considering these numbers of constant-weight and constant-charge RLL sequences as coefficients of convergent power series, generating functions are derived. The fact, that generating function for enumerating constant-charge RLL sequences does not have a closed form, is proved. Implementation of encoding and decoding procedures using Cover's enumerative scheme is shown. On the base of obtained results, some examples, such as enumeration of running-digital-sum (RDS) constrained RLL sequences or peak-shifts control capability are also provided.
No associations
LandOfFree
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes 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 Constant-Weight and Constant-Charge Binary Run-Length Limited Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constant-Weight and Constant-Charge Binary Run-Length Limited Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-157219