Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Improving the data recovery for short length LT codes

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 10 No. 2 (2020)

DOI
10.11591/ijece.v10i2.pp1972-1979
ISSN
2088-8708, 2088-8708
Published
2020-04-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.

Collaboration network of the authors

10 authors · 17 co-authorship links · 5 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Middle Technical University
  • University of Information Technology and Communications
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Bushra Mahmoud WaheibMiddle Technical University2
Nahla Abdul Jalil SalihMiddle Technical University2
kareem Ghazi AbdulhusseinMiddle Technical University1
Naseer M. YasinMiddle Technical University1
Jaafar A. AldhaibaniUniversity of Information Technology and Communications1
Yaseen Naser JurnUniversity of Information Technology and Communications1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Improving the data recovery for short length LT codes</dc:title><dc:creator>Abdulkhaleq, Nadhir Ibrahim</dc:creator><dc:creator>Abed, Faeza Abbas</dc:creator><dc:creator>Hasan, Ihsan Jabbar</dc:creator><dc:creator>Mahdi, Falah Hasan</dc:creator><dc:description>&lt;jats:p&gt;Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process.  In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation.  It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2020-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v10i2.pp1972-1979</dc:identifier><dc:identifier>10.11591/ijece.v10i2.pp1972-1979</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 10 No 2 (2020); 1972</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/17856/pdf</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>