arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.05774cs.ITcs.CRmath.IT
收藏

本原无比率码

Primitive Rateless Codes

Mahyar Shirvanimoghaddam

摘要:

在本文中,我们提出了原始无比率(PR)码。PR码的特征在于消息长度和$\mathbf{GF}(2)$上的本原多项式,其可以生成潜在无限数量的编码符号。我们发现,在任何任意长度截断的PR码的码字可以表示为一个最大长度序列($m$ -序列)的序列。我们刻画了PR码的Hamming重量分布和它们的多项式,并证明了对于适当选择的本原多项式,PR码的Hamming重量分布可以很好地近似于截断二项分布.我们进一步找到PR码的最小汉明重量的下限,并表明,总是存在一个PR码,可以满足任何期望的码字长度的这个界限。我们提供了一个原始多项式的列表,消息长度高达$40$,并表明,各自的PR码密切满足吉尔伯特-Varshamov界在各种速率。仿真结果表明,在不同的信噪比和码率下,PR码可以达到与BCH码相似的误块率出错率。PR码是速率兼容的,可以根据需要生成尽可能多的编码符号;因此,展示了真正的无速率性能。

英文摘要:

In this paper, we propose primitive rateless (PR) codes. A PR code is characterized by the message length and a primitive polynomial over $\mathbf{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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑