.png){kind=icon}
返回
Primitive Rateless Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2021.3096961.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose primitive rateless (PR) codes. A PR code is characterized by the message length and a primitive polynomial over GF(2), which can generate a potentially limitless number of coded symbols. We show that codewords of a PR code truncated at any arbitrary length can be represented as subsequences of a maximum-length sequence (m-sequence). We characterize the Hamming weight distribution of PR codes and their duals and show that for a properly chosen primitive polynomial, the Hamming weight distribution of the PR code can be well approximated by the truncated binomial distribution. We further find a lower bound on the minimum Hamming weight of PR codes and show that there always exists a PR code that can meet this bound for any desired codeword length. We provide a list of primitive polynomials for message lengths up to 40 and show that the respective PR codes closely meet the Gilbert-Varshamov bound at various rates. Simulation results show that PR codes can achieve similar block error rates as their BCH counterparts at various signal-to-noise ratios (SNRs) and code rates. PR codes are rate-compatible and can generate as many coded symbols as required; thus, demonstrating a truly rateless performance.
Keyword:
Hamming weight
Encoding
Generators
Wireless communication
Simulation
Receivers
Polar codes
Finite field
Gilbert-Varshamov bound
linear-feedback shift-register
rate-compatible codes
rateless codes
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏
Design of Rate-Compatible Structured LDPC Codes for Hybrid ARQ Applications用于混合ARQ应用的速率兼容结构化LDPC码设计OAAI
OAAI分享收藏
查看更多内容