The Random Coding Bound Is Tight for the Average Linear Code or Lattice
暂无分享,去创建一个
Meir Feder | Ram Zamir | Yuval Domb | M. Feder | R. Zamir | Y. Domb | Yuval Domb
[1] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[2] Yuval Kochman,et al. Lattice Coding for Signals and Networks: Side-information problems , 2014 .
[3] Neri Merhav,et al. Lower bounds on the error probability of block codes based on improvements on de Caen's inequality , 2004, IEEE Transactions on Information Theory.
[4] Yuval Kochman,et al. Lattice Coding for Signals and Networks: Lattice shaping , 2014 .
[5] Alexander Barg,et al. Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.
[6] Meir Feder,et al. Finite-Dimensional Infinite Constellations , 2011, IEEE Transactions on Information Theory.
[7] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .
[8] Alexander Barg,et al. On the asymptotic accuracy of the union bound , 2004, ArXiv.
[9] Carl Ludwig Siegel,et al. A Mean Value Theorem in Geometry of Numbers , 1945 .
[10] Gregory Poltyrev,et al. On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.
[11] Uri Erez,et al. A Simple Proof for the Existence of “Good” Pairs of Nested Lattices , 2012, IEEE Transactions on Information Theory.
[12] Hans-Andrea Loeliger,et al. Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.
[13] Robert G. Gallager,et al. The random coding bound is tight for the average code (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[14] Dominique de Caen,et al. A lower bound on the probability of a union , 1997, Discret. Math..
[15] C. A. Rogers,et al. A modified form of Siegel's mean-value theorem , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.