Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/8714
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPrakash, G.-
dc.contributor.authorNayak, M.-
dc.contributor.authorKulkarni, M.-
dc.contributor.authorShripathi, Acharya U.-
dc.date.accessioned2020-03-30T10:22:36Z-
dc.date.available2020-03-30T10:22:36Z-
dc.date.issued2011-
dc.identifier.citation2011 IEEE Recent Advances in Intelligent Computational Systems, RAICS 2011, 2011, Vol., , pp.671-674en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/8714-
dc.description.abstractFountain Codes are essentially Forward Error Correction (FEC) codes, which were developed for applications involving multicasting or for delivering large amounts of content to multiple recipients simultaneously. FEC increases the reliability of a system in a noisy environment. Luby Transform codes (LT codes) which come from a new coding family of the Fountain codes are the first realization of rateless codes which can generate potentially limitless code words from data. In this paper, a performance analysis of Fountain codes for erasure channels, which use the Robust Soliton distribution for encoding the data packets and belief propagation to decode the received packets has been carried out Results show that the overhead during decoding is around 11.2%. � 2011 IEEE.en_US
dc.titlePerformance analysis of fountain codes with Robust Soliton distribution for erasure channelsen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
8714.pdf851.73 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.