Error exponents for optimum decoding of the degraded broadcast channel using moments of type class enumerators
暂无分享,去创建一个
[1] János Körner,et al. Universally attainable error exponents for broadcast channels with degraded message sets , 1980, IEEE Trans. Inf. Theory.
[2] Thomas M. Cover,et al. Broadcast channels , 1972, IEEE Trans. Inf. Theory.
[3] Toby Berger,et al. Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.
[4] Neri Merhav,et al. Error exponents for degraded broadcast channels with degraded message sets , 2008, 2008 IEEE International Symposium on Information Theory.
[5] Neri Merhav,et al. Relations Between Random Coding Exponents and the Statistical Physics of Random Codes , 2007, IEEE Transactions on Information Theory.
[6] Andrew J. Viterbi,et al. Principles of Digital Communication and Coding , 1979 .
[7] János Körner,et al. General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.
[8] Neri Merhav,et al. Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators , 2007, IEEE Transactions on Information Theory.
[9] Neri Merhav,et al. Error Exponents of Optimum Decoding for the Interference Channel , 2010, IEEE Transactions on Information Theory.
[10] Neri Merhav,et al. Error exponents of optimum decoding for the degraded broadcast channel using moments of type class enumerators , 2008, 2009 IEEE International Symposium on Information Theory.
[11] Patrick P. Bergmans,et al. Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.