Error Exponents for Variable-length Block Codes with Feedback and Cost Constraints
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 as a function of constraints $R, \AV$, and on the transmission rate, average cost, and average block length respectively. For given and $\AV$, the lower and upper bounds to the exponent are asymptotically equal as . The resulting reliability function, , as a function of 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.