N-user trellis coding for a class of multiple-access channels

@article{Chevillat1981NuserTC,
  title={N-user trellis coding for a class of multiple-access channels},
  author={Pierre R. Chevillat},
  journal={IEEE Trans. Information Theory},
  year={1981},
  volume={27},
  pages={114-120}
}
A simple proof using random partitions and typicality is given for Marton’s coding theorem for broadcast channels. In [l] Marton established an achievable-rate region for the discrete memoryless broadcast channel (DMBC). Her proof uses a random coding method which is a combination of the coding techniques of Bergmans [2], Cover [3], and van der Meulen [4], together with the random coding technique used to prove source coding theorems in rate-distortion theory. Her theorem is a generalization of… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
15 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

N-user trellis coding for a class of multiple-access channels,

  • P. R. Chevillat
  • IBM Res. Rept. RZ 928,
  • 1979

S

  • NATO Advanced StuQ Inst., Darlington, England, Aug.
  • C. Chang and E. J. Weldon, “Code construction for…
  • 1977

A coding theorem for multiple-access channels with correlated sources,

  • D. Slepian, J. K. Wolf
  • Bell Syst. Tech. J.,
  • 1973

Similar Papers

Loading similar papers…