A Hybrid Automatic Repeat reQuest Scheme Based on Maximum Distance Separable Codes.
S. Chenglin, D. Jia, Y. Yang, H. Yu, C. Sun, and Z. Fei. ChinaCom (1), volume 209 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 87-96. Springer, (2016)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/chinacom/ChenglinJYYSF16
%A Chenglin, Shangguan
%A Jia, Dai
%A Yang, Yanbao
%A Yu, Hanxiao
%A Sun, Ce
%A Fei, Zesong
%B ChinaCom (1)
%D 2016
%E Chen, Qianbin
%E Meng, Weixiao
%E Zhao, Liqiang
%I Springer
%K dblp
%P 87-96
%T A Hybrid Automatic Repeat reQuest Scheme Based on Maximum Distance Separable Codes.
%U http://dblp.uni-trier.de/db/conf/chinacom/chinacom2016-1.html#ChenglinJYYSF16
%V 209
%@ 978-3-319-66625-9
@inproceedings{conf/chinacom/ChenglinJYYSF16,
added-at = {2018-05-07T00:00:00.000+0200},
author = {Chenglin, Shangguan and Jia, Dai and Yang, Yanbao and Yu, Hanxiao and Sun, Ce and Fei, Zesong},
biburl = {https://www.bibsonomy.org/bibtex/289131502a3d31568a206586637e28d82/dblp},
booktitle = {ChinaCom (1)},
crossref = {conf/chinacom/2016-1},
editor = {Chen, Qianbin and Meng, Weixiao and Zhao, Liqiang},
ee = {https://doi.org/10.1007/978-3-319-66625-9_9},
interhash = {33da198ca4c2ebf966af3167279b6645},
intrahash = {89131502a3d31568a206586637e28d82},
isbn = {978-3-319-66625-9},
keywords = {dblp},
pages = {87-96},
publisher = {Springer},
series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering},
timestamp = {2019-12-19T11:46:31.000+0100},
title = {A Hybrid Automatic Repeat reQuest Scheme Based on Maximum Distance Separable Codes.},
url = {http://dblp.uni-trier.de/db/conf/chinacom/chinacom2016-1.html#ChenglinJYYSF16},
volume = 209,
year = 2016
}