DocumentCode :
2270293
Title :
On The Computational Complexity Of An Optimal Code For A Run-length-limited Channel
Author :
Varanasi, Chandra ; Kieffer, John C.
Author_Institution :
University of Minnesota
fYear :
1991
fDate :
24-28 Jun 1991
Firstpage :
226
Lastpage :
226
Keywords :
Bismuth; Channel capacity; Computational complexity; Data compression;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1991 (papers in summary form only received), Proceedings. 1991 IEEE International Symposium on (Cat. No.91CH3003-1)
Print_ISBN :
0-7803-0056-4
Type :
conf
DOI :
10.1109/ISIT.1991.695282
Filename :
695282
Link To Document :
بازگشت