DocumentCode
2387579
Title
Approximation of the resource bounded complexity distortion function
Author
Sow, Daby ; Eleftheriadis, Alexandros
Author_Institution
Dept. of Electr. Eng., Columbia Univ., New York, NY, USA
fYear
2000
fDate
2000
Firstpage
206
Abstract
This work addresses the coding of finite binary sequences with a finite amount of decoding computational resources. In this setting, we propose a general coding methodology and discuss its convergence properties
Keywords
binary sequences; computational complexity; convergence of numerical methods; decoding; genetic algorithms; rate distortion theory; source coding; coding; computational resources; convergence properties; decoding; finite binary sequences; genetic algorithms; resource bounded complexity distortion function; time complexity; Binary sequences; Communication systems; Convergence; Decoding; Distortion measurement; Genetic algorithms; Genetic programming; Performance evaluation; Rate-distortion; Search problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866504
Filename
866504
Link To Document