Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |


Daby Sow, Alexandros Eleftheriadis. Representing Information with Computational Resource Bounds. In Asilomar Conference on Signals, Systems, and Computers (Invited Paper), February 1998.

Download [help]

Download paper: Adobe portable document (pdf)

Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


A general framework for data compression, in which computational resource bounds are introduced at both the encoding and decoding end, is presented. We move away from Shannon's traditional communication system by introducing some structure at the decoder and model it by a Turing machine with finite computational resources. Information is measured using the resource bounded Kolmogorov complexity. In this setting, we investigate the design of efficient lossy encoders

BibTex Reference

   Author = {Sow, Daby and Eleftheriadis, Alexandros},
   Title = {Representing Information with Computational Resource Bounds},
   BookTitle = {Asilomar Conference on Signals, Systems, and Computers (Invited Paper)},
   Month = {February},
   Year = {1998}

EndNote Reference [help]

Get EndNote Reference (.ref)


For problems or questions regarding this web site contact The Web Master.

This document was translated automatically from BibTEX by bib2html (Copyright 2003 © Eric Marchand, INRIA, Vista Project).