CFP last date
20 May 2024
Reseach Article

Transmission of Data in Noisy Channel using Applications of Fountain Codes

by Gurpreet Kour
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 2
Year of Publication: 2017
Authors: Gurpreet Kour
10.5120/ijca2017915902

Gurpreet Kour . Transmission of Data in Noisy Channel using Applications of Fountain Codes. International Journal of Computer Applications. 179, 2 ( Dec 2017), 42-44. DOI=10.5120/ijca2017915902

@article{ 10.5120/ijca2017915902,
author = { Gurpreet Kour },
title = { Transmission of Data in Noisy Channel using Applications of Fountain Codes },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2017 },
volume = { 179 },
number = { 2 },
month = { Dec },
year = { 2017 },
issn = { 0975-8887 },
pages = { 42-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number2/28712-2017915902/ },
doi = { 10.5120/ijca2017915902 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:54:18.124782+05:30
%A Gurpreet Kour
%T Transmission of Data in Noisy Channel using Applications of Fountain Codes
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 2
%P 42-44
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data is transmitted in the form of packets on the Internet. Due to various channel complexities, some packets may get lost and never reach their destination. Reliable transmission of data over the Internet is always desirable. Current networks that use mostly unicast -based protocols such as the transport control protocol TCP/IP and other unicast protocols place strong importance on the ordering of packets to simplify coding at the expense of increased traffic. An alternative approach is where packets are not ordered and the recovery of some subset of packets will allow for successful decoding. This class of such codes, called fountain codes, was pioneered by a startup called Digital Fountain and has greatly influenced the design of codes for binary erasure channels (BECs), a well-established model for the Internet [1]. This paper includes two fountain codes system models for packet recovery and bit error correction, a study of pre-codes of Raptor codes, and proposing a hybrid fast decoding algorithm to reduce the overheads of short and moderate-length LT codes.

References
  1. Lin, S., and Costello, D.J. Jr.: “Error control coding: fundamentals and applications”, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.
  2. Luby M.: “LT codes”, IEEE Symposium on Foundations of Computer Science, 2002, pp. 271–282.
  3. Shokrollahi A.: “Raptor codes”, IEEE Transactions of information theory, 2006, pp. 2551-2567.
  4. Kushwaha H. and Chandramouli R.: “Reliable Multimedia Transmission Over Cognitive Radio Networks Using Fountain Codes”,IEEE Transactions, DOI: 10.1109/JPROC.2007.909917
  5. Palanki R. and Yedidia J.S.: “Rateless Codes on Noisy Channels”,Proceedings of the Conference on Information Sciences and Systems, 2004, pp.1-15.
  6. Sejdinovi´c D., Piechocki R., Doufexi A. and Ismail M.: “Fountain Code Design for Data Multicast with Side Information”, IEEE Transaction on wireless communication, 2009, pp.5155-5165.
  7. Kasai K., Declercq D. and Sakaniwa K.: “Fountain Coding via Multiplicatively Repeated Non-Binary LDPC Codes”, IEEE Transactions on Communications, 2012, pp.2077-2083.
Index Terms

Computer Science
Information Sciences

Keywords

LT codes Raptor codes error rate.