Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Blackwell channel

The Blackwell channel is a deterministic broadcast channel model used in coding theory and information theory. It was first proposed by mathematician… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this letter, we introduce a class of discrete memoryless broadcast channels, called noisy Blackwell channels, which generalize… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
2015
2015
This paper shows that the Maddah-Ali-Tse (MAT) scheme, which achieves the symmetric capacity of two example broadcast channels… Expand
  • figure 1
  • table I
  • table II
  • table III
2015
2015
The broadcast channel (BC) with one confidential message and where the decoders cooperate via a one-sided link is considered. A… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
2013
2013
We establish an information inequality concerning five random variables. This inequality is motivated by the sum-rate evaluation… Expand
  • figure 1
  • figure 2
Highly Cited
2012
Highly Cited
2012
A write-once memory (WOM) is a storage device that consists of cells that can take on <formula formulatype="inline"><tex Notation… Expand
  • table I
  • table II
  • table III
  • figure 1
  • figure 2
2010
2010
A Write Once Memory (WOM) is a storage medium with binary memory elements, called cells, that can change from the zero state to… Expand
  • figure 1
  • figure 2
  • figure 3
Review
2007
Review
2007
A key idea in coding for the broadcast channel (BC) is binning, in which the transmitter encode information by selecting a… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Review
2005
Review
2005
  • W. Yu, M. Aleksic
  • Proceedings. International Symposium on…
  • 2005
  • Corpus ID: 13286843
Practical implementation of random binning is one of the key challenges in achieving the largest available rate regions for many… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1981
Highly Cited
1981
A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels. 
1981
1981
Trellis coding is investigated for a class of N -user multiple-access channels. It is shown that N -user trellis coding, in… Expand
  • figure 2
  • figure 4
  • figure 5
  • table I
  • table II