Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Lingxiao Xia"'
Publikováno v:
ISIT
Han-Kobayashi achievable region forms the best known inner bound for a general discrete memoryless interference channel. We show that the capacity region can be strictly larger than the Han-Kobayashi region for some channel realizations, and hence th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebce850e1fd1d87a9ac1e4f9cc24a331
https://doi.org/10.1109/isit.2015.7282889
https://doi.org/10.1109/isit.2015.7282889
Publikováno v:
ISIT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::064b03c77d700283f908a119b0d0d822
https://doi.org/10.1109/isit.2014.6874989
https://doi.org/10.1109/isit.2014.6874989
Autor:
Lingxiao Xia, Chandra Nair
Publikováno v:
ISIT
In this paper we show that superposition coding is not optimal for three-receiver more capable channels. The optimality of superposition coding region has been open for k-receiver (k ≥ 3) more capable broadcast channel. The main contribution is in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dafbfa9889502ee24722270ec370856
https://doi.org/10.1109/isit.2012.6284213
https://doi.org/10.1109/isit.2012.6284213
Publikováno v:
INFOCOM
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters (size of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54fc70221404db232e8cef03626727eb
https://doi.org/10.1109/infcom.2011.5935297
https://doi.org/10.1109/infcom.2011.5935297
Publikováno v:
INFOCOM, 2011 Proceedings IEEE; 2011, p766-774, 9p
Publikováno v:
2015 IEEE Energy Conversion Congress & Exposition (ECCE); 2015, p2416-2420, 5p
Publikováno v:
2015 IEEE Energy Conversion Congress & Exposition (ECCE); 2015, pvii-l, 44p
Publikováno v:
2014 IEEE International Symposium on Information Theory; 2014, p1031-1035, 5p
Publikováno v:
2014 IEEE International Symposium on Information Theory; 2014, p1-51, 51p
Publikováno v:
2014 IEEE International Symposium on Information Theory; 2014, p1-22, 22p