Error exponents of optimum decoding for the interference channel

IEEE Transactions on Information Theory

Volumn 56, Issue 1, 2010, Pages 40-56

  Etkin, Raúl Hernán ^a   Merhav, Neri ^b   Ordentlich, Erik ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Error exponent region; Large deviations; Method of types; Statistical physics

Indexed keywords

ANALYTICAL TOOL; CODEWORD; CONVENTIONAL TECHNIQUES; ERROR EXPONENT; ERROR EXPONENT REGIONS; EXPONENTIAL ERROR BOUNDS; INTERFERENCE CANCELLATION; INTERFERENCE CHANNELS; INTERFERING SIGNALS; LARGE DEVIATIONS; NOISE PROCESS; OPTIMUM DECODER; PERFORMANCE ANALYSIS; RANDOM CODING; STATISTICAL PHYSICS;

COMPUTATIONAL FLUID DYNAMICS; ERROR CORRECTION; PHYSICS;

DECODING;

EID: 73849085990     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2034892     Document Type: Article

References (17)

1. T. S. Han and K. Kobayashi, "A new achievable rate region for the interference channel," IEEE Trans. Inf. Theory, vol. IT-27, no. 1, pp. 49-60, Jan. 1981.
2. A. B. Carleial, "A case where interference does not reduce capacity," IEEE Trans. Inf. Theory, vol. IT-21, no. 5, pp. 569-570, Sep. 1975.
3. R. Etkin, D. N. C. Tse, and H. Wang, "Gaussian interference channel capacity to within one bit," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5534-5562, Dec. 2008.
4. L. Weng, S. S. Pradhan, and A. Anastasopoulos, "Error exponent regions for Gaussian broadcast and multiple-access channels," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 2919-2942, Jul. 2008.
5. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
6. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Budapest, Hungary: Akadémiai Kiadó, 1981.
7. N. Merhav, "Relations between random coding exponents and the statistical physics of random codes," IEEE Trans. Inf. Theory, vol. 55, no. 1, pp. 83-92, Jan. 2009.
8. N. Merhav, "Error exponents of erasure/list decoding revisited via moments of distance enumerators," IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4439-4447, Oct. 2008.
9. Y. Kaspi and N. Merhav, "Error exponents for broadcast channels with degraded message sets," IEEE Trans. Inf. Theory, submitted for publication.
10. R. Etkin, N. Merhav, and E. Ordentlich, "Error exponents of optimum decoding for the interference channel," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 1523-1527.
11. R. Etkin and E. Ordentlich, "Discrete memoryless interference channel: New outer bound," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 2851-2855.
12. C. Chang, R. Etkin, and E. Ordentlich, "Interference channel capacity region for randomized fixed-composition codes," 2009 [Online]. Available: http://www.hpl.hp.com/techreports/2008/HPL-2008-194R1.html.
13. C. Chang, "Interference channel capacity region for randomized fixe-composition codes," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep./Oct. 2009.
14. J. Pokorny and H. Wallmeier, "Random coding bound and codes produced by permutations for the multiple-access channel," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 741-750, Nov. 1985.
15. Y.-S. Liu and B. L. Hughes, "A new universal random coding bound for the multiple-access channel," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 376-386, Mar. 1996.
16. M. Mézard and A. Montanari, Information, Physics and Computation. New York: Oxford Univ. Press, 2009.
17. A. Nazari, A. Anastasopoulos, and S. Pradhan, "A new universal random-coding bound for average probability error exponent for multiple-access channels," in Proc. Conf. Information Sciences and Systems (CISS), 2009, Jan. 2009, arXiv:0901.0948v1 [cs.IT].