Upper bound and approximation of random access throughput over chase combining HARQ. Burkov, A., Matveev, N., Turlikov, A. M., Bulanov, A., Gahnina, O., & Andreev, S. In 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2017, Munich, Germany, November 6-8, 2017, pages 143–147, 2017. IEEE.
Upper bound and approximation of random access throughput over chase combining HARQ [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/icumt/BurkovMTBGA17,
  author       = {Artem Burkov and
                  Nikolay Matveev and
                  Andrey M. Turlikov and
                  Alexey Bulanov and
                  Olga Gahnina and
                  Sergey Andreev},
  title        = {Upper bound and approximation of random access throughput over chase
                  combining {HARQ}},
  booktitle    = {9th International Congress on Ultra Modern Telecommunications and
                  Control Systems and Workshops, {ICUMT} 2017, Munich, Germany, November
                  6-8, 2017},
  pages        = {143--147},
  publisher    = {{IEEE}},
  year         = {2017},
  url          = {https://doi.org/10.1109/ICUMT.2017.8255206},
  doi          = {10.1109/ICUMT.2017.8255206},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icumt/BurkovMTBGA17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0