The Blackwell channel is a deterministic broadcast channel model used in coding theory and information theory. It was first proposed by mathematicianâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Lanying Zhao, Sung-Ik Choi, Sae-Young Chung
- IEEE Communications Letters
- 2016

In this letter, we introduce a class of discrete memoryless broadcast channels, called noisy Blackwell channels, which generalizeâ€¦Â (More)

Is this relevant?

2015

2015

- Ziv Goldfeld, Gerhard Kramer, Haim H. Permuter
- 2015 IEEE International Symposium on Informationâ€¦
- 2015

The broadcast channel (BC) with one confidential message and where the decoders cooperate via a one-sided link is considered. Aâ€¦Â (More)

Is this relevant?

2012

2012

- Eitan Yaakobi, Scott Kayser, Paul H. Siegel, Alexander Vardy, Jack K. Wolf
- IEEE Transactions on Information Theory
- 2012

A write-once memory (WOM) is a storage device that consists of cells that can take on <formula formulatype="inline"><tex Notationâ€¦Â (More)

Is this relevant?

2010

2010

- Eitan Yaakobi, Scott Kayser, Paul H. Siegel, Alexander Vardy, Jack K. Wolf
- 2010 IEEE Information Theory Workshop
- 2010

A Write Once Memory (WOM) is a storage medium with binary memory elements, called cells, that can change from the zero state toâ€¦Â (More)

Is this relevant?

Review

2007

Review

2007

- Alfredo Braunstein, Farbod Kayhan, Guido Montorsi, Riccardo Zecchina
- 2007 IEEE International Symposium on Informationâ€¦
- 2007

A key idea in coding for the broadcast channel (BC) is binning, in which the transmitter encode information by selecting aâ€¦Â (More)

Is this relevant?

Review

2005

Review

2005

- Wei Yu, Maja AleksiÄ‡
- Proceedings. International Symposium onâ€¦
- 2005

Practical implementation of random binning is one of the key challenges in achieving the largest available rate regions for manyâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Abbas El Gamal, Edward C. van der Meulen
- IEEE Trans. Information Theory
- 1981

A simple proof using random partitions and typicality is given for Martonâ€™s coding theorem for broadcast channels. In [l] Martonâ€¦Â (More)

Is this relevant?

1981

1981

- Pierre R. Chevillat
- IEEE Trans. Information Theory
- 1981

A simple proof using random partitions and typicality is<lb>given for Martonâ€™s coding theorem for broadcast channels. In [lâ€¦Â (More)

Is this relevant?