A Study on the Problem of Channel Resolvability for Channels with Countable Input Alphabet

Shigeaki Kuzuoka. A Study on the Problem of Channel Resolvability for Channels with Countable Input Alphabet. In International Symposium on Information Theory and Its Applications, ISITA 2018, Singapore, October 28-31, 2018. pages 349-353, IEEE, 2018. [doi]

@inproceedings{Kuzuoka18-0,
  title = {A Study on the Problem of Channel Resolvability for Channels with Countable Input Alphabet},
  author = {Shigeaki Kuzuoka},
  year = {2018},
  doi = {10.23919/ISITA.2018.8664277},
  url = {https://doi.org/10.23919/ISITA.2018.8664277},
  researchr = {https://researchr.org/publication/Kuzuoka18-0},
  cites = {0},
  citedby = {0},
  pages = {349-353},
  booktitle = {International Symposium on Information Theory and Its Applications, ISITA 2018, Singapore, October 28-31, 2018},
  publisher = {IEEE},
  isbn = {978-4-88552-318-2},
}