DocumentCode
2452355
Title
Computational cutoff rate of an input runlength-limited BSC
Author
Yang, Shih-Hsuan
Author_Institution
Nat. Taipei Inst. of Technol., Taiwan
Volume
3
fYear
1996
fDate
23-27 Jun 1996
Firstpage
1550
Abstract
Runlength-limited (RLL) codes are widely used in digital recording systems. A new lower bound for the computational cutoff rate of a binary symmetric channel having an input runlength-limited constraint is derived. The derivation is based on a random coding argument together with generating function techniques. Our result outperforms the existing lower hound
Keywords
channel capacity; digital storage; recording; runlength codes; telecommunication channels; RLL codes; binary symmetric channel; computational cutoff rate; generating function techniques; input runlength-limited BSC; input runlength-limited constraint; lower bound; random coding; runlength-limited codes; Channel capacity; Decoding; Error probability; Interference constraints; Modulation coding; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on
Conference_Location
Dallas, TX
Print_ISBN
0-7803-3250-4
Type
conf
DOI
10.1109/ICC.1996.533670
Filename
533670
Link To Document