Zobrazeno 1 - 10
of 1 794
pro vyhledávání: '"Tornado code"'
Publikováno v:
IEEE Transactions on Communications. 69:7139-7153
Lossless data transfer over communication networks has traditionally been achieved by means of ARQ protocols. However, the last ten years have seen an increasing interest in using erasure-correcting codes as an alternative, with the goal of reducing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc17062946fcbb41a02db3915d8d2195
https://doi.org/10.1109/tcomm.2021.3106676
https://doi.org/10.1109/tcomm.2021.3106676
In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes with conv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94b74cf4413999a99cec64d37274aa28
Autor:
Hanxu Hou, Yunghsiang S. Han
Publikováno v:
IEEE Transactions on Communications. 66:521-533
Array codes have been widely used in communication and storage systems. To reduce computational complexity, one important property of the array codes is that only exclusive OR operations are used in the encoding and decoding processes. Cauchy Reed–
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edb318119754503c6d3988b934e2c55f
https://doi.org/10.1109/tcomm.2017.2766140
https://doi.org/10.1109/tcomm.2017.2766140
Publikováno v:
Digital Signal Processing. 73:83-92
This paper presents a new algorithm to reduce significantly the computational cost of one of the best methods with self-recovery capabilities in the fragile watermarking literature. This is achieved by generating two sequences of reference bits assoc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ddbf1925e4f5441deb90bfde8e02ae5
https://doi.org/10.1016/j.dsp.2017.11.005
https://doi.org/10.1016/j.dsp.2017.11.005
Publikováno v:
Advances in Mathematics of Communications. 12:189-198
We study complementary information set codes of length \begin{document}$tn$\end{document} and dimension \begin{document}$n$\end{document} of order \begin{document}$t$\end{document} called ( \begin{document}$t-$\end{document} CIS code for short). Quas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3da1495175f56d5f2b96a53967e8f88
https://doi.org/10.3934/amc.2018013
https://doi.org/10.3934/amc.2018013
Publikováno v:
IEEE Transactions on Communications. 65:5123-5136
The focus of this paper is on the analysis and design of Raptor codes using a multi-edge framework. In this regard, we first represent the Raptor code as a multi-edge type low-density parity-check (METLDPC) code. This MET representation gives a gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::841183531885befd92c28c724c92d4c4
https://doi.org/10.1109/tcomm.2017.2750179
https://doi.org/10.1109/tcomm.2017.2750179
Autor:
Chi Wan Sung, Xueqing Gong
Publikováno v:
Journal of Computer and System Sciences. 89:190-208
An erasure code is said to be k-reliable if it maps k source packets into n coded packets, and any k out of the n coded packets allow recovery of the original k source packets. Codes of k-reliability achieve the best reliability-storage tradeoff, whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1914b6601d61da89a30a7e3b9db8832a
https://doi.org/10.1016/j.jcss.2017.05.005
https://doi.org/10.1016/j.jcss.2017.05.005
Publikováno v:
ACM Transactions on Storage. 13:1-27
Erasure codes are widely used in distributed storage systems to prevent data loss. Traditional codes suffer from a typical repair-bandwidth problem in which the amount of data required to reconstruct the lost data, referred to as the repair bandwidth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78500dfbb54c7953bc14ea82dcc58710
https://doi.org/10.1145/3109479
https://doi.org/10.1145/3109479
Publikováno v:
China Communications. 14:1-9
In this paper, we focus on short-block nonbinary LDPC (NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDPC codes. Notice that the parity-che
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edc23b2b1b7f24140665f050664348d8
https://doi.org/10.1109/cc.2017.8014342
https://doi.org/10.1109/cc.2017.8014342
Autor:
Krishna Kaipa
Publikováno v:
IEEE Transactions on Information Theory. 63:4940-4948
We study the problem of classifying deep holes of Reed–Solomon codes. We show that this problem is equivalent to the problem of classifying maximum distance separable (MDS) extensions of Reed–Solomon codes by one digit. This equivalence allows us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc1f1130783821dfbd98b3887a752b8e
https://doi.org/10.1109/tit.2017.2706677
https://doi.org/10.1109/tit.2017.2706677