Comparison of BP and Gauss code base on fountain code

Fan Zhang, Lixin Xu, Xi Pan*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

Fountain codes are erasure channels in superior performance of sparse matrix code. Files are transmitted into multiple small packets, each of which is either received without error or not received. Fountain codes are based on the packets communication. The decoder can start to transmit packets without any knowledge of which packets are received. In the paper, introduce the fountain code, LT code, BP code and Gauss code. Encode the packets and using different method to decode the packets. Compared BP code and Gauss code on successful decode rate, required time and overhead packets.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011
Pages737-740
Number of pages4
DOIs
Publication statusPublished - 2011
Event3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011 - Shanghai, China
Duration: 6 Jan 20117 Jan 2011

Publication series

NameProceedings - 3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011
Volume1

Conference

Conference3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011
Country/TerritoryChina
CityShanghai
Period6/01/117/01/11

Keywords

  • BP code Gauss code
  • Fountain code
  • Headpackets rate
  • LT codes
  • Required timeover

Fingerprint

Dive into the research topics of 'Comparison of BP and Gauss code base on fountain code'. Together they form a unique fingerprint.

Cite this