2011Unpublished venueRequires access

A new class of rateless codes

Yilong Xiao, Jiang Haibo

Open publisher page 0 citations

Abstract

Classic rateless codes, such as Raptor codes and LT codes are long codes. But special applications such as multimedia broadcasting and Multicast Server usually require small length codes (a few hundred in size). In response to this demand, we propose a new construction method of small length rateless system codes. The generator matrix of our proposed coding scheme is a special 0-1 random matrix in which every element is valued independently and identically and has same probability to be valued 1. Theoretical analysis and simulation experiments show that, when using maximum likelihood decoding, the rateless code generated by our method can be decoded with extremely high probability under the limitation of both small code length and small decoding overhead.

About this research paper

What this paper is about

Classic rateless codes, such as Raptor codes and LT codes are long codes. But special applications such as multimedia broadcasting and Multicast Server usually require small length codes (a few hundred in size). In response to this demand, we propose a new construction method of small length rateless system codes. The generator matrix of our proposed coding scheme is a special 0-1 random matrix in which every element is valued independently and identically and has same probability to be valued 1. Theoretical analysis and simulation experiments show that, when using maximum likelihood decoding, the rateless code generated by our method can be decoded with extremely high probability under the limitation of both small code length and small decoding overhead.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Classic rateless codes, such as Raptor codes and LT codes are long codes. But special applications such as multimedia broadcasting and Multicast Server usually require small length codes (a few hundred in size). In response to this demand, we propose a new construction method of small length rateless system codes. The generator matrix of our proposed coding scheme is a special 0-1 random matrix in which every element is valued independently and identically and has same probability to be valued 1. Theoretical analysis and simulation experiments show that, when using maximum likelihood decoding, the rateless code generated by our method can be decoded with extremely high probability under the limitation of both small code length and small decoding overhead.

Key concepts: Raptor code, Computer science, Online codes, Fountain code, Tornado code, Decoding methods, Luby transform code, Generator matrix

Related papers

Back to paper searchBrowse research topicsOriginal source
A new class of rateless codes — Research Paper | ScholarLens