{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/33802"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/33802","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Variable block length coding for channels with feedback and cost constraints","abstract":"Variable-decoding-time/generalized block-coding schemes are investigated for discrete memoryless channels (DMC) with perfect feedback (error free, delay free, infinite capacity) under cost constraints. For a given number of messages and average error probability, upper and lower bounds are found for expected decoding time. These coincide with each other up to a proportionality constant which approaches one in a certain asymptotic sense. A resulting reliability function is found for variable decoding time DMC's with perfect feedback under a cost constraint. The results in this work generalize Burnashev's results, to the cost constrained case.","abstract_html":"Variable-decoding-time/generalized block-coding schemes are investigated for discrete memoryless channels (DMC) with perfect feedback (error free, delay free, infinite capacity) under cost constraints. For a given number of messages and average error probability, upper and lower bounds are found for expected decoding time. These coincide with each other up to a proportionality constant which approaches one in a certain asymptotic sense. A resulting reliability function is found for variable decoding time DMC's with perfect feedback under a cost constraint. The results in this work generalize Burnashev's results, to the cost constrained case.","abstract_has_math":false,"creators":["Nakiboḡlu, Bariş"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Robert R. Gallager and Moe Z. Win."],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005","date_published":"2005","updated_at":"2026-07-22T22:21:36Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/33802","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Robert R. Gallager and Moe Z. Win."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Nakiboḡlu, Bariş"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2006-08-25T17:44:28Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2006-08-25T17:44:28Z"]},{"key":"dc:date.issued","label":"Date","values":["2005"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/33802"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Includes bibliographical references (p. 95-96)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Variable-decoding-time/generalized block-coding schemes are investigated for discrete memoryless channels (DMC) with perfect feedback (error free, delay free, infinite capacity) under cost constraints. For a given number of messages and average error probability, upper and lower bounds are found for expected decoding time. These coincide with each other up to a proportionality constant which approaches one in a certain asymptotic sense. A resulting reliability function is found for variable decoding time DMC's with perfect feedback under a cost constraint. The results in this work generalize Burnashev's results, to the cost constrained case."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Variable block length coding for channels with feedback and cost constraints"]}]}],"canonical_facts":{"dc:contributor.advisor":["Robert R. Gallager and Moe Z. Win."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Nakiboḡlu, Bariş"],"dc:date.accessioned":["2006-08-25T17:44:28Z"],"dc:date.available":["2006-08-25T17:44:28Z"],"dc:date.issued":["2005"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Includes bibliographical references (p. 95-96)."],"dc:description.abstract":["Variable-decoding-time/generalized block-coding schemes are investigated for discrete memoryless channels (DMC) with perfect feedback (error free, delay free, infinite capacity) under cost constraints. For a given number of messages and average error probability, upper and lower bounds are found for expected decoding time. These coincide with each other up to a proportionality constant which approaches one in a certain asymptotic sense. A resulting reliability function is found for variable decoding time DMC's with perfect feedback under a cost constraint. The results in this work generalize Burnashev's results, to the cost constrained case."],"dc:description.degree":["S.M."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/33802"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Variable block length coding for channels with feedback and cost constraints"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:36Z"}