Enumeration of constant-weight run-length limited binary sequences

Authors:
O. F. Kurmaev
Affiliations:
Moscow State Institute of Electronic Technology, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 8
Cited 0

Efficient balanced codes

IEEE Transactions on Information Theory
Coding of Run-Length-Limited Sequences

Problems of Information Transmission
Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros

Problems of Information Transmission
On row-by-row coding for 2-D constraints

IEEE Transactions on Information Theory
Fast enumeration of run-length-limited words

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Knuth's balanced codes revisited

IEEE Transactions on Information Theory
Codes for digital recorders

IEEE Transactions on Information Theory
An enumerative method for runlength-limited codes: permutation codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constant-weight binary sequences with constrained run lengths of zeros and ones are introduced. These run-length constraints are separate and independent. Using the Babkin-Cover enumerative scheme, the number of these sequences is found. Then enumeration-based encoding and decoding procedures are constructed.