首页 | 官方网站   微博 | 高级检索  
     

关于线性时间复损码的研究
引用本文:慕建君,孙韶辉,王新梅.关于线性时间复损码的研究[J].电子学报,2002,30(1):122-125.
作者姓名:慕建君  孙韶辉  王新梅
作者单位:西安电子科技大学综合业务网国家重点实验室,陕西西安 710071
基金项目:国家自然科学基金 (No .69972 0 35)
摘    要:本文对基于随机二部图的复损码进行了深入的研究.提出了给定度分布对的复损码成功译码时可接受最大损失δ的一上界,通过对此上界的详细分析提出了求解复损码度分布对的一种算法.这就从理论上说明了具有如上算法选取度分布对的复损码,应该优于文2]所给度分布对的复损码.而且证明了具有某一确定度分布对的复损码能以线性时间可编码和可成功地译码.

关 键 词:复损码  随机二部图  编译码复杂度  度分布对算法  
文章编号:0372-2112(2002)01-0122-04
收稿时间:2000-09-19

Study on Linear Time Loss-Resilient Codes
MU Jian jun,SUN Shao hui,WANG Xin mei.Study on Linear Time Loss-Resilient Codes[J].Acta Electronica Sinica,2002,30(1):122-125.
Authors:MU Jian jun  SUN Shao hui  WANG Xin mei
Affiliation:National Key Lab.of ISN,Xidian University,Xi'an,Shaanxi 710071,China
Abstract:A detailed study of loss-resilient codes based on random bipartite graphs are made in this paper.We propose the upper bound on the maximum tolerable loss fraction δ for which the decoding of the loss-resilient code with a given degree distribution pair is successfull.The algorithm to find the degree distribution pair of loss-resilient codes is presented by making a detailed analysis of this upper bound.This result shows that codes constructed from degree distribution pair obtained by the algorithm above should perform better than the degree distribution pair given in 2].Moreover,we prove loss-resilient code with the definite degree distribution pair can be both encoded and decoded successfully in linear time.
Keywords:loss  resilient code  random bipartite graph  encoding and decoding complexity  degree distribution pair algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号