Novel Fountain Codes Based on Modulo and Extended Euclidean

ZHU Wen-jie; YI Ben-shun; GAN Liang-cai; YAO Wei-qing

doi:10.3969/j.issn.0372-2112.2017.04.013

您当前的位置：

首页 >

文章列表页 >

Novel Fountain Codes Based on Modulo and Extended Euclidean

更新时间：2025-07-16

- Novel Fountain Codes Based on Modulo and Extended Euclidean
- Acta Electronica Sinica Vol. 45, Issue 4, Pages: 855-862(2017)
- 作者机构：
  
  1. 武汉大学电子信息学院,湖北,武汉,430072
  2. 武汉大学深圳研究院,广东,深圳,518000
  3. 武汉大学电子信息学院,湖北,武汉,430072
  4. 武汉大学深圳研究院,广东,深圳,518000
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61371125, No.61072041);Shenzhen Basic Research Program of Guangdong Province (No.JCYJ20150630153917254)
- DOI：10.3969/j.issn.0372-2112.2017.04.013
  CLC： TN911.2
- Published Online：25 April 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
ZHU Wen-jie, YI Ben-shun, GAN Liang-cai, et al. Novel Fountain Codes Based on Modulo and Extended Euclidean[J]. Acta Electronica Sinica, 2017, 45(4): 855-862.
DOI：

ZHU Wen-jie, YI Ben-shun, GAN Liang-cai, et al. Novel Fountain Codes Based on Modulo and Extended Euclidean[J]. Acta Electronica Sinica, 2017, 45(4): 855-862. DOI： 10.3969/j.issn.0372-2112.2017.04.013.

摘要

针对中国剩余定理在模运算喷泉码译码过程中的固有不足，本文提出一种全新的基于扩展欧几里德定理的译码算法.该算法采用合并线性同余方程组，避免分解因子非互质情况下求解乘率因子失败的问题.模运算喷泉码将信息数据编码为自然数分解因子和相对应的模余数的数据包，接收方只要获取一定数目的编码数据包就能成功解码.基于扩展欧几里得定理的译码算法扩展了模运算喷泉码的分解因子范围，提高了编译码效率.本文通过理论分析和数值仿真证实了这种编译码算法的可行性.

Abstract

Aiming at the intrinsic problems of Chinese Remainder Theorem in fountain decoding process with modular arithmetic

this paper proposes a decoding algorithm based on extended Euclidean theorem.The linear congruence equations are merged in the extended Euclidean decoding algorithm

which avoids the failure of solving the rate factor when the decomposition factors are non-coprime.In the modular arithmetic fountain encoding process

the original packet is continuously decomposed by the factor

which is randomly selected from the natural number

into the encoded packets consisting of the residues and the factors.When a certain amount of packets are received

it can be achieved to decode successfully.The codec efficiency has been improved as the algorithm has extended the range of the modular arithmetic factor.Through theoretical analysis and numerical simulation

the effectiveness of this decoding algorithm of modular arithmetic fountain code has been proved.

关键词

Keywords

references

Views

910

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Product Ownership Transfer Scheme of RFID-Enabled Supply Chain Based on Blockchain

Design and Analysis of LT Code with Reverse Edge Growth Framework

Leveled Group Key Management for Wireless Sensor Networks ( 1.Key Laboratory of Computer Networks and Information Security ,Xidian University,Xi'an,Shaanxi 710071,China; 2.Graduate School,Beijing Electronic Science and Technology Institute,Beijing 100070,China; 3.No.36 Research Institute of CETC ,Jiaxing,Zhejiang 314033,China)

Cryptanalysis and Improvement of a Group Signature Scheme

A Group Signature Scheme Based on Chinese Remainder Theorem

Related Author

CHEN Dong-dong

ZENG Cong-ai

LIU Chang-geng

LIU Ya-li

LU Qi-peng

NING Jian-ting

SONG Xin

CHENG Nai-ping

Related Institution

Faculty of Data Science, City University of Macau, Macau

School of Cyber Science and Engineering, Wuhan University

Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology

College of Computer Science and Technology, Jiangsu Normal University

Department of Graduate Management, Space Engineering University

⁰