2026-09-19T09:25:59Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/338022022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Robert R. Gallager and Moe Z. Win.
Nakiboḡlu, Bariş
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-08-25T17:44:28Z
2006-08-25T17:44:28Z
2005
2005
http://hdl.handle.net/1721.1/33802
70078763
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).
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.
by Bariş Nakiboḡlu.
S.M.
96 p.
472133 bytes
467434 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Variable block length coding for channels with feedback and cost constraints
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7adf60dc-4380-4ab9-881e-aa681de55f77">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Variable block length coding for channels with feedback and cost constraints</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Nakiboḡlu, Bariş</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>