Skip to main navigation Skip to search Skip to main content

Bounds on the finite-length raptorq codes under maximum likelihood decoding

  • Harbin Institute of Technology Shenzhen

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

Abstract

In this paper, we analysis the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes with a high-order low density generator-matrix (LDGM) code as the pre-code. By investigating the rank of the product of two random coefficient matrices, we derive upper and lower bounds of DFP on the RaptorQ codes under ML decoding algorithm. Finally, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations with different degree distributions. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.

Original languageEnglish
Title of host publicationCommunications, Signal Processing, and Systems - Proceedings of the 2017 International Conference on Communications, Signal Processing, and Systems
EditorsQilian Liang, Min Jia, Jiasong Mu, Wei Wang, Xuhong Feng, Baoju Zhang
PublisherSpringer Verlag
Pages831-838
Number of pages8
ISBN (Print)9789811065705
DOIs
StatePublished - 2019
Externally publishedYes
Event6th International Conference on Communications, Signal Processing, and Systems, CSPS 2017 - Harbin, China
Duration: 14 Jul 201716 Jul 2017

Publication series

NameLecture Notes in Electrical Engineering
Volume463
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference6th International Conference on Communications, Signal Processing, and Systems, CSPS 2017
Country/TerritoryChina
CityHarbin
Period14/07/1716/07/17

Keywords

  • Decoding failure probability
  • Massive Machine-to-Machine (mM2M) communications
  • Maximum likelihood decoding
  • RaptorQ codes

Fingerprint

Dive into the research topics of 'Bounds on the finite-length raptorq codes under maximum likelihood decoding'. Together they form a unique fingerprint.

Cite this