DocumentCode
1256979
Title
Variable-length state splitting with applications to average runlength-constrained (ARC) codes
Author
Heegard, Chris D. ; Marcus, Brian H. ; Siegel, Paul H.
Author_Institution
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
Volume
37
Issue
3
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
759
Lastpage
777
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
channel capacity; encoding; graph theory; magnetic storage; ARC systems; average runlength constraints; capacity; fixed-rate codes; free binary source; magnetic storage; running average runlength; state splitting algorithm; variable-length graphs; Algorithm design and analysis; Binary sequences; Code standards; Construction industry; Decoding; Helium; Information theory; Magnetic memory; Telegraphy; Timing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.79946
Filename
79946
Link To Document