Primitive Rateless Codes

by   Mahyar Shirvanimoghaddam, et al.

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


page 1

page 2

page 3

page 4


On the Hamming Weight Distribution of Subsequences of Pseudorandom Sequences

In this paper, we characterize the average Hamming weight distribution o...

Two-weight codes over the integers modulo a prime power

Let p be a prime number. Irreducible cyclic codes of length p^2-1 and di...

On the parameters of extended primitive cyclic codes and the related designs

Very recently, Heng et al. studied a family of extended primitive cyclic...

On the Arithmetic Complexities of Hamming Codes and Hadamard Codes

In this paper, we study the arithmetic complexities of Hamming codes and...

MWS and FWS Codes for Coordinate-Wise Weight Functions

A combinatorial problem concerning the maximum size of the (hamming) wei...

On components of a Kerdock code and the dual of the BCH code C_1,3

In the paper we investigate the structure of i-components of two classes...

Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations

The study of Armstrong codes is motivated by the problem of understandin...

Please sign up or login with your details

Forgot password? Click here to reset