{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/16882"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/16882","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Relating information-theoretic limits to the lyapunov exponent of a dynamical system","abstract":"In this thesis we use control theoretic techniques to provide a new perspective for analyzing some problems in information theory. In particular, we explore two related data dissemination problems - channel coding with feedback and source coding with feedforward - and see that the Lyapunov exponent of a related dynamical system emerges as a fundamental quantity. For channel coding with feedback, we show that for a broad class of channels - both with and without memory - the Lyapunov exponent of the transmission function is fundamentally linked to the maximum rate which the scheme can attain. We note that the posterior matching scheme - a provably optimal feedback communication scheme for memoryless channels - has an encoding function with a Lyapunov exponent exactly equal to the communication rate. In the dual problem, source coding with feedforward, the optimal test channel is memoryless. This motivates the idea of dualizing posterior matching for this setting. By exploiting the Lyapunov exponent property, we demonstrate that such a scheme - with low decoder complexity - attains the rate-distortion function. By approaching these problems from a dynamical systems perspective, we hope to provide the intuition to motivate the evaluation and design of new communication schemes.","abstract_html":"In this thesis we use control theoretic techniques to provide a new perspective for analyzing some problems in information theory. In particular, we explore two related data dissemination problems - channel coding with feedback and source coding with feedforward - and see that the Lyapunov exponent of a related dynamical system emerges as a fundamental quantity. For channel coding with feedback, we show that for a broad class of channels - both with and without memory - the Lyapunov exponent of the transmission function is fundamentally linked to the maximum rate which the scheme can attain. We note that the posterior matching scheme - a provably optimal feedback communication scheme for memoryless channels - has an encoding function with a Lyapunov exponent exactly equal to the communication rate. In the dual problem, source coding with feedforward, the optimal test channel is memoryless. This motivates the idea of dualizing posterior matching for this setting. By exploiting the Lyapunov exponent property, we demonstrate that such a scheme - with low decoder complexity - attains the rate-distortion function. By approaching these problems from a dynamical systems perspective, we hope to provide the intuition to motivate the evaluation and design of new communication schemes.","abstract_has_math":false,"creators":["Ebeid, Hani-James M."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Coleman, Todd P."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-08-20T18:00:41Z","date_published":"2010-08-20T18:00:41Z","updated_at":"2026-07-22T22:25:09Z","subjects":["Feedback","Feedforward","Posterior Matching","Lyapunov Exponent"],"languages":["en"],"rights":["Copyright 2010 Hani-James M. Ebeid"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/16882","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Coleman, Todd P."]},{"key":"dc:creator","label":"Author","values":["Ebeid, Hani-James M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-08-20T18:00:41Z","2010-08"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Feedback","Feedforward","Posterior Matching","Lyapunov Exponent"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Hani-James M. Ebeid"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/16882"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis we use control theoretic techniques to provide a new perspective for analyzing some problems in information theory. In particular, we explore two related data dissemination problems - channel coding with feedback and source coding with feedforward - and see that the Lyapunov exponent of a related dynamical system emerges as a fundamental quantity. For channel coding with feedback, we show that for a broad class of channels - both with and without memory - the Lyapunov exponent of the transmission function is fundamentally linked to the maximum rate which the scheme can attain. We note that the posterior matching scheme - a provably optimal feedback communication scheme for memoryless channels - has an encoding function with a Lyapunov exponent exactly equal to the communication rate. In the dual problem, source coding with feedforward, the optimal test channel is memoryless. This motivates the idea of dualizing posterior matching for this setting. By exploiting the Lyapunov exponent property, we demonstrate that such a scheme - with low decoder complexity - attains the rate-distortion function. By approaching these problems from a dynamical systems perspective, we hope to provide the intuition to motivate the evaluation and design of new communication schemes.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-20T22:03:45Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Ebeid_Hani-James.pdf: 248130 bytes, checksum: df36c9d2834cb8a05df50f5ef4ba8208 (MD5)","Made available in DSpace on 2010-08-20T18:00:41Z (GMT). No. of bitstreams: 2 Ebeid_Hani-James.pdf: 248130 bytes, checksum: df36c9d2834cb8a05df50f5ef4ba8208 (MD5) license.txt: 4058 bytes, checksum: d3f45a341bda6652ed09cfddcb6657a4 (MD5)"]},{"key":"dc:title","label":"Title","values":["Relating information-theoretic limits to the lyapunov exponent of a dynamical system"]}]}],"canonical_facts":{"dc:contributor":["Coleman, Todd P."],"dc:creator":["Ebeid, Hani-James M."],"dc:date":["2010-08-20T18:00:41Z","2010-08"],"dc:description":["In this thesis we use control theoretic techniques to provide a new perspective for analyzing some problems in information theory. In particular, we explore two related data dissemination problems - channel coding with feedback and source coding with feedforward - and see that the Lyapunov exponent of a related dynamical system emerges as a fundamental quantity. For channel coding with feedback, we show that for a broad class of channels - both with and without memory - the Lyapunov exponent of the transmission function is fundamentally linked to the maximum rate which the scheme can attain. We note that the posterior matching scheme - a provably optimal feedback communication scheme for memoryless channels - has an encoding function with a Lyapunov exponent exactly equal to the communication rate. In the dual problem, source coding with feedforward, the optimal test channel is memoryless. This motivates the idea of dualizing posterior matching for this setting. By exploiting the Lyapunov exponent property, we demonstrate that such a scheme - with low decoder complexity - attains the rate-distortion function. By approaching these problems from a dynamical systems perspective, we hope to provide the intuition to motivate the evaluation and design of new communication schemes.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-20T22:03:45Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Ebeid_Hani-James.pdf: 248130 bytes, checksum: df36c9d2834cb8a05df50f5ef4ba8208 (MD5)","Made available in DSpace on 2010-08-20T18:00:41Z (GMT). No. of bitstreams: 2 Ebeid_Hani-James.pdf: 248130 bytes, checksum: df36c9d2834cb8a05df50f5ef4ba8208 (MD5) license.txt: 4058 bytes, checksum: d3f45a341bda6652ed09cfddcb6657a4 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/16882"],"dc:language":["en"],"dc:rights":["Copyright 2010 Hani-James M. Ebeid"],"dc:subject":["Feedback","Feedforward","Posterior Matching","Lyapunov Exponent"],"dc:title":["Relating information-theoretic limits to the lyapunov exponent of a dynamical system"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:09Z"}