Variable-length state splitting with applications to average runlength-constrained (ARC) codes
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 759-777
- https://doi.org/10.1109/18.79946
Abstract
A new class of constrained systems average runlength constraints (ARCs), is defined by requiring that the sum of n consecutive run lengths be bounded above by a linear function of n. In particular, the running average runlength of every sequence in the system is bounded above by a constant. A general result is given on the capacity of ARC systems. The state splitting algorithm is then improved for variable-length graphs. This is then applied to obtain high, fixed-rate codes from the free binary source to ARC systems. As an example, a rate 1/2, (d,k)=Keywords
This publication has 13 references indexed in Scilit:
- Bounds on the number of states in encoder graphs for input-constrained channelsIEEE Transactions on Information Theory, 1991
- The power spectrum of run-length-limited codesIEEE Transactions on Communications, 1989
- On runlength codesIEEE Transactions on Information Theory, 1988
- Sliding-block coding for input-restricted channelsIEEE Transactions on Information Theory, 1988
- Conditional limit theorems under Markov conditioningIEEE Transactions on Information Theory, 1987
- A note on the Shannon capacity of run-length-limited codes (Corresp.)IEEE Transactions on Information Theory, 1987
- Maxentropic Markov chains (Corresp.)IEEE Transactions on Information Theory, 1984
- Construction of Bounded Delay Codes for Discrete Noiseless ChannelsIBM Journal of Research and Development, 1982
- Factors and extensions of full shiftsMonatshefte für Mathematik, 1979
- Zero-Modulation Encoding in Magnetic RecordingIBM Journal of Research and Development, 1975