University of Surrey

Test tubes in the lab Research in the ATI Dance Research

LT codes decoding: Design and analysis

Lu, F, Foh, CH, Cai, J and Chia, L-T (2009) LT codes decoding: Design and analysis

Full text not available from this repository.

Abstract

LT codes provide an efficient way to transfer information over erasure channels. Past research has illustrated that LT codes can perform well for a large number of input symbols. However, it is shown that LT codes have poor performance when the number of input symbols is small. We notice that the poor performance is due to the design of the LT decoding process. In this respect, we present a decoding algorithm called full rank decoding that extends the decodability of LT codes by using Wiedemann algorithm. We provide a detailed mathematical analysis on the rank of the random coefficient matrix to evaluate the probability of successful decoding for our proposed algorithm. Our studies show that our proposed method reduces the overhead significantly in the cases of small number of input symbols yet preserves the sim plicity of the original LT decoding process. © 2009 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
NameEmailORCID
Lu, FUNSPECIFIEDUNSPECIFIED
Foh, CHc.foh@surrey.ac.ukUNSPECIFIED
Cai, JUNSPECIFIEDUNSPECIFIED
Chia, L-TUNSPECIFIEDUNSPECIFIED
Date : 2009
Identification Number : https://doi.org/10.1109/ISIT.2009.5206067
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 12:39
Last Modified : 17 May 2017 15:05
URI: http://epubs.surrey.ac.uk/id/eprint/836197

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800