Results 21 to 30 of about 2,636,497 (234)
Spinal code based on lightweight hash function [PDF]
Archives of Electrical Engineering, 2019 A spinal code is the type of rateless code, which has been proved to be capacity- achieving over both a binary symmetric channel (BSC) and an additive white Gaussian noise (AWGN) channel. Rateless spinal codes employ a hash function as a coding kernel to
Lina Wang, Xinran Li
doaj +1 more source
Weighted zigzag decodable fountain codes for unequal error protection
IET Communications, Volume 16, Issue 17, Page 2082-2090, October 2022., 2022 Abstract By combining bit‐shift and exclusive‐or operations, a weighted zigzag decodable fountain code is proposed to achieve an unequal error protection property. In the proposed scheme, the input symbols of different importance levels are first pre‐coded into variable nodes using low‐density parity‐check codes.
Yin Zhang +5 more
wiley +1 more source
Expanding window fountain codes for unequal error protection [PDF]
, 2009 A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed.
Doufexi, A +4 more
core +2 more sources
CRC‐AFC‐based dynamic spectrum resource optimisation for URLLC access in 5G‐advanced and 6G
IET Signal Processing, Volume 16, Issue 8, Page 885-896, October 2022., 2022 Abstract Ultra‐reliable low‐latency communication (URLLC) has the most stringent end‐to‐end communication performance requirements among the three major 5G scenarios. The URLLC enhancement research on 5G‐advanced and 6G needs to be explored continuously.
Qian Huang, Xianzhong Xie, Hong Tang
wiley +1 more source
Capacity-achieving rateless polar codes [PDF]
2016 IEEE International Symposium on Information Theory (ISIT), 2016 A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show that this scheme is capacity-achieving, i.e.
Li, Bin +3 more
openaire +2 more sources
Wireless Communications and Mobile Computing, Volume 2022, Issue 1, 2022., 2022 The future communication requirements for industrial automation will differ significantly from existing technologies. Traffic in Industry 4.0 imposes real‐time requirements, requiring ultra‐reliable communication (URC) with high reliability and minimal latency. The demand for ultra‐high reliability as high as 99.999999 percent and as low as 1 ms end‐to‐
Athirah Mohd Ramly +3 more
wiley +1 more source
Rateless Distributed Source Code Design [PDF]
Proceedings of the 5th International Mobile Multimedia Communications Conference, 2009 Over the past decade, rateless codes, i.e., digital fountain codes, have emerged as an efficient and robust solution for reliable data transmission over packet erasure networks and a particularly suitable one for multicasting and broadcasting applications where users may experience variable channel conditions and packet loss rates, such as mobile ...
Sejdinovic, D, Piechocki, RJ, Doufexi, A
openaire +2 more sources
LT Codes with Double Encoding Matrix Reorder Physical Layer Secure Transmission
Journal of Sensors, Volume 2022, Issue 1, 2022., 2022 In traditional wireless sensor networks, information transmission usually uses data encryption methods to prevent information from being stolen illegally. However, once the encryption methods are leaked, eavesdropping nodes can easily obtain information.
Hang Zhang +4 more
wiley +1 more source
Rateless Codes for AVC Models [PDF]
IEEE Transactions on Information Theory, 2010 14 pages, double column, extended version of paper to appear in the IEEE Transactions on Information ...
Sarwate, A D, Gastpar, M
openaire +4 more sources
Rate‐compatible systematic polar codes
IET Communications, Volume 15, Issue 15, Page 1930-1940, September 2021., 2021 Abstract Puncturing and shortening are two common ways to achieve rate‐compatible non‐systematic polar codes (NSPCs). Systematic polar codes (SPCs) have been shown to outperform NSPCs with the same encoding and decoding complexity. However, rate‐compatible SPCs have never been comprehensively studied in previous work. In this paper, two rate‐compatible
Hongfei Zhu +3 more
wiley +1 more source