Zobrazeno 1 - 10
of 1 484
pro vyhledávání: '"network coding schemes"'
In this paper, we propose a methodology to compute the optimal finite-length coding rate for random linear network coding schemes over a line network. To do so, we first model the encoding, reencoding, and decoding process of different coding schemes
Externí odkaz:
http://arxiv.org/abs/1805.05783
In this paper, we propose two novel physical layer aware adaptive network coding and coded modulation schemes for time variant channels. The proposed schemes have been applied to different satellite communications scenarios with different Round Trip
Externí odkaz:
http://arxiv.org/abs/1704.04698
In this paper, we propose novel energy efficient adaptive network coding and modulation schemes for time variant channels. We evaluate such schemes under a realistic channel model for open area environments and Geostationary Earth Orbit (GEO) satelli
Externí odkaz:
http://arxiv.org/abs/1704.04789
Autor:
Dao, Thanh Hai
Publikováno v:
In Optical Fiber Technology January 2018 40:93-100
Autor:
Kaddoum, Georges, El-Hajjar, Mohammed
In this paper we design network coding schemes for Differential Chaos Shift Keying (DCSK) modulation. In this work, non-coherent chaos-based communication system is used due to its simplicity and robustness to multipath propagation effects, while dis
Externí odkaz:
http://arxiv.org/abs/1505.02851
Publikováno v:
Iraqi Journal of Information & Communication Technology, Vol 4, Iss 2 (2021)
Huge data rates have been provided by 5G wireless communication systems using millimeter wave (mmWave) band that have frequencies ranging from 30 to 300 GHz. mmWave provides much wider bandwidth than the existing 4G band. The 5G network deals with ma
Externí odkaz:
https://doaj.org/article/b9f59ce835264a2d9a9f0f113e692c5d
Publikováno v:
Proceedings 2011 IEEE International Symposium on Information Theory (ISIT 2011), pp. 109-113
The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622--633] the present authors showed that if a classical k-
Externí odkaz:
http://arxiv.org/abs/1012.4583
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.