DocumentCode :
3274552
Title :
A coding theorem of runlength limited channel
Author :
Vámos, Peter
Author_Institution :
Dept. of Telecommun. & Telematics, Budapest Univ. of Technol. & Econ., Hungary
fYear :
2001
fDate :
2001
Firstpage :
66
Abstract :
The most important and widely applied channel constraints are those the runlength limiting (RLL) ones. Besides the runlength, there frequently is a set constraint for the accumulated charge or for some of its transforms. For the binary channel Y:Yi∈{-1,+1} such constraints can be described as |Σi=0∞hiYn-i |⩽c. The constraints complying with this is referred as the generalized charge constraint, and those are set to satisfy some spectral requirement
Keywords :
channel coding; runlength codes; set theory; accumulated charge; binary channel; channel coding; channel constraints; charge constrained channel; coding theorem; generalized charge constraint; runlength limited channel; set constraint; spectral requirement; transforms; Channel capacity; Codes; Frequency; History; Telematics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
Type :
conf
DOI :
10.1109/ISIT.2001.935929
Filename :
935929
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3274552
بازگشت