Papers
Topics
Authors
Recent
Search
2000 character limit reached

Error Exponents for Variable-length Block Codes with Feedback and Cost Constraints

Published 20 Dec 2006 in cs.IT and math.IT | (0612097v1)

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⁡P_{e,\min} as a function of constraints $R, \AV$, and τˉ\bar \tau on the transmission rate, average cost, and average block length respectively. For given RR and $\AV$, the lower and upper bounds to the exponent −(ln⁡Pe,min⁡)/τˉ-(\ln P_{e,\min})/\bar \tau are asymptotically equal as τˉ→∞\bar \tau \to \infty. The resulting reliability function, lim⁡τˉ→∞(−ln⁡Pe,min⁡)/τˉ\lim_{\bar \tau\to \infty} (-\ln P_{e,\min})/\bar \tau, as a function of RR 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.