Distributed Rateless Codes Based on Random Matrices

Yi Long Xiao; Hai Bo Jiang

doi:10.4028/www.scientific.net/AMR.756-759.2326

Paper Titles

The Algebraic Semantics of EPDL at Activity Level and Verification
p.2306

Algebraic Semantics-Based Verification for EPDL at Task Level
p.2311

An Android Terminal in TelosB Wireless Sensor Networks
p.2316

Research and Application of Rule Engine in Scheduled Outage Management
p.2321

Distributed Rateless Codes Based on Random Matrices
p.2326

A Middleware-Based Network Architecture for the Web of Things
p.2332

Self-Adapting Acquisition of Sensor Data in Mobile Environment
p.2339

The Application of Electronic Map in Wireless Positioning System
p.2345

Effect of Modulation Index of Mach-Zehnder Modulator on Single Sideband Radio over Fiber System
p.2350

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759Distributed Rateless Codes Based on Random...

Distributed Rateless Codes Based on Random Matrices

Abstract:

When multiple source node nodes need to transmit their data packets through a single relay to a common destination, distributed rateless codes can be employed. In this paper, a new kind of completely random rateless codes and its distributed encoding process is proposed based on random matrices theory. The proposed method is very easy to implement. The decoding performance is determined by the rank property of random matrices. Both theoretical analysis and simulation results show that the proposed method is effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

2326-2331

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.2326

Citation:

Cite this paper

Online since:

September 2013

Authors:

Yi Long Xiao, Hai Bo Jiang

Keywords:

Distributed Encoding Process, Random Matrices, Rateless Codes

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. Luby, LT codes, Proc. The 43rd Annual IEEE Symp. on Foundations of Computer Science (FCS 02), IEEE Press, November 2002, p.271–280.

DOI: 10.1109/sfcs.2002.1181950

Google Scholar

[2] A. Shokrollahi, Raptor codes, IEEE Transaction on Information Theory, vol. 52, no 6, p.2551–2567, (2006).

DOI: 10.1109/tit.2006.874390

Google Scholar

[3] S. Puducheri, J. Kliewer, and T. E. Fuja, The design and performance of distributed LT codes, IEEE Transaction on Information Theory, vol. 53, no. 10, pp.3740-3754, (2007).

DOI: 10.1109/tit.2007.904982

Google Scholar

[4] A. Talari and N. Rahnavard, Distributed unequal error protection rateless codes over erasure channels: A two-source scenario, IEEE Transaction on Communications, vol. 60, no. 8, pp.2084-2090, (2012).

DOI: 10.1109/tcomm.2012.051512.110109

Google Scholar

[5] A. Talari and N. Rahnavard, Distributed rateless codes with UEP property, Proc. IEEE International Symp. Information Theory (ISIT 2009), June 2010, pp.2453-2457.

DOI: 10.1109/isit.2010.5513758

Google Scholar

[6] D. Sejdinovic, R. J. Piechocki, A. Doufexi, and M. Ismail, Decentralised distributed fountain coding: asymptotic analysis and design, IEEE Communications Letters, vol. 14, no. 1, pp.42-44, (2010).

DOI: 10.1109/lcomm.2010.01.091541

Google Scholar

[7] D. Sejdinovic, R. J. Piechocki, and A. Doufexi, AND-OR tree analysis of distributed LT codes, Proc. IEEE Information Theory Workshop on Networking and Information Theory (ITW 2009), IEEE Press, June 2009, p.261–265.

DOI: 10.1109/itwnit.2009.5158583

Google Scholar