Fountain codes based on modulo and neural network
by Zaihui Deng; Xiaojun Tong; Benshun Yi; Liangcai Gan
International Journal of Information and Communication Technology (IJICT), Vol. 9, No. 4, 2016

Abstract: In this paper, a new approach to fountain codes named Chinese transform (CT) codes is proposed. The encoding of CT codes transforms finite original symbols into theoretically infinite encoding symbols, which are generated by integers selected uniformly from the set of primes that are then enveloped into packets by a chaotic position scrambling algorithm. When a sufficient amount of packets are received, there is a 100% chance that the original symbols can be recovered by using the CT decoding algorithm. Using the improved Hopfield neural network to decode the CT codes can significantly increase efficiency and thus advancing the practical use of CT codes. The experiments in this paper demonstrate the feasibility and availability of the encoding and decoding of CT codes.

Online publication date: Mon, 24-Oct-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com