Nested linear codes achieve Marton's inner bound for general broadcast channels

Arun Padakandla, Sandeep S. Pradhan. Nested linear codes achieve Marton's inner bound for general broadcast channels. In Alexander Kuleshov, Vladimir Blinovsky, Anthony Ephremides, editors, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011. pages 1554-1558, IEEE, 2011. [doi]

@inproceedings{PadakandlaP11,
  title = {Nested linear codes achieve Marton's inner bound for general broadcast channels},
  author = {Arun Padakandla and Sandeep S. Pradhan},
  year = {2011},
  doi = {10.1109/ISIT.2011.6033805},
  url = {http://dx.doi.org/10.1109/ISIT.2011.6033805},
  researchr = {https://researchr.org/publication/PadakandlaP11},
  cites = {0},
  citedby = {0},
  pages = {1554-1558},
  booktitle = {2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011},
  editor = {Alexander Kuleshov and Vladimir Blinovsky and Anthony Ephremides},
  publisher = {IEEE},
  isbn = {978-1-4577-0596-0},
}