Error exponents of optimum decoding for the degraded broadcast channel using moments of type class enumerators

Authors:
Yonatan Kaspi;Neri Merhav
Affiliations:
Department of Electrical Engineering, Technion, Israel Institute of Technology, Technion City, Haifa, Israel;Department of Electrical Engineering, Technion, Israel Institute of Technology, Technion City, Haifa, Israel
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 4
Cited 0

Principles of Digital Communication and Coding

Principles of Digital Communication and Coding
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Relations between random coding exponents and the statistical physics of random codes

IEEE Transactions on Information Theory
Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The analysis of random coding error exponents pertaining to optimal decoding in a degraded broadcast with degraded message sets is revisited. Instead of using Jensens inequality as well as some other inequalities in the derivation, we demonstrate that, after an initial step, an exponentially tight analysis can be carried out by assessing the relevant moments of a certain type class enumerator.