
Decoding of LT‐Like Codes in the Absence of Degree‐One Code Symbols
Author(s) -
Abdulkhaleq Nadhir I.,
Gazi Orhan
Publication year - 2016
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.16.0116.0107
Subject(s) - fountain code , decoding methods , luby transform code , erasure , degree distribution , computer science , degree (music) , algorithm , code (set theory) , raptor code , theoretical computer science , symbol (formal) , list decoding , block code , arithmetic , concatenated error correction code , mathematics , physics , set (abstract data type) , acoustics , programming language , world wide web , complex network
Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree‐one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree‐one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree‐one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory‐based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.