Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints

From MaRDI portal
Publication:3604722

DOI10.1109/TIT.2007.915913zbMATH Open1306.94016arXivcs/0612097OpenAlexW3102848392MaRDI QIDQ3604722FDOQ3604722


Authors: B. Nakiboğlu, Robert G. Gallager Edit this on Wikidata


Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error Pe,min as a function of constraints R,AV, and on the transmission rate, average cost, and average block length respectively. For given R and AV, the lower and upper bounds to the exponent are asymptotically equal as . The resulting reliability function, , as a function of R and AV, is concave in the pair (R,AV) and generalizes the linear reliability function of Burnashev to include cost constraints. The results are generalized to a class of discrete-time memoryless channels with arbitrary alphabets, including additive Gaussian noise channels with amplitude and power constraints.


Full work available at URL: https://arxiv.org/abs/cs/0612097




Recommendations





Cited In (3)





This page was built for publication: Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604722)