Discrete memoryless interference channel: New outer bound

被引：1

作者：

Etkin, Raul ^{[1
]}

Ordentlich, Erik ^{[1
]}

机构：

[1] Hewlett Packard Labs, Palo Alto, CA 94304 USA

来源：

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年

关键词：

D O I：

10.1109/ISIT.2007.4557190

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A new outer bound for the two-user discrete memoryless interference channel is presented. This bound establishes the capacity region of the binary erasure interference channel, whose determination was left open in [6]. The new bound is compared with the best known outer bounds for some additional examples. It is also shown that the new outer bound is tight for a one-sided deterministic interference channel that belongs to the class studied by El Gamal and Costa.

引用

页码：2851 / 2855

页数：5

共 50 条

[41] Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels [J].

Sahebi, Aria G. ;

Pradhan, S. Sandeep .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) :7839-7857

[42] Maximal-Capacity Discrete Memoryless Channel Identification [J].

Egger, Maximilian ;

Bitar, Rawad ;

Wachter-Zeh, Antonia ;

Gunduz, Deniz ;

Weinberger, Nir .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (02) :1248-1265

[43] CAPACITY PER UNIT COST OF A DISCRETE MEMORYLESS CHANNEL [J].

ABDELGHAFFAR, KAS .

ELECTRONICS LETTERS, 1993, 29 (02) :142-144

[44] EXPONENTIAL BOUNDS ON PROBABILITY OF ERROR FOR A DISCRETE MEMORYLESS CHANNEL [J].

KOTZ, S .

ANNALS OF MATHEMATICAL STATISTICS, 1961, 32 :577-&

[45] PARTIAL FEEDBACK FOR THE DISCRETE MEMORYLESS MULTIPLE ACCESS CHANNEL [J].

WILLEMS, FMJ ;

VANDERMEULEN, EC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) :287-290

[46] Covert Communication Over a Compound Discrete Memoryless Channel [J].

Ahmadipour, Mehrasa ;

Salehkalaibar, Sadaf ;

Yassaee, Mohammad Hossein ;

Tan, Vincent Y. F. .

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, :982-986

[47] SIMPLE DERIVATION OF LOWER BOUND TO RCOMP FOR DISCRETE MEMORYLESS CHANNELS [J].

DICK, RJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (05) :595-596

[48] EXPONENTIAL BOUNDS ON THE PROBABILITY OF ERROR FOR A DISCRETE MEMORYLESS CHANNEL [J].

KOTZ, S .

ANNALS OF MATHEMATICAL STATISTICS, 1961, 32 (02) :577-582

[49] On the discrete memoryless partially cooperative broadcast relay channel [J].

Bross, Shraga I. .

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :1241-1245

[50] The discrete memoryless multiple access channel with confidential messages [J].

Liu, Ruoheng ;

Maric, Ivana ;

Yates, Roy D. ;

Spasojevic, Predrag .

2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :957-+

← 1 2 3 4 5 →