期刊文献+

基于级联稀疏二部图的右边正则纠删码精确阈值

下载PDF
导出
摘要 提出了确定删除恢复算法下右边正则纠删码阈值的一个简单方法.证明了计算右边正则纠删码阈值的一个精确公式.这个新方法可避免求度分布函数的微分和逆这些复杂的运算。数值结果表明所提出新方法的有效性.
出处 《自然科学进展》 北大核心 2008年第5期596-600,共5页
基金 国家自然科学基金资助项目(批准号 60573034 60572149)
  • 相关文献

参考文献15

  • 1Elias P. Coding for two noisy channels. In: Proceedings of Information Theory, Third London Symp, London, Butterworths, September, New York: Academic Press, 1955, 61-74.
  • 2Luby M. , Mitzenmacher M, Shokrollahi MA, et al. Practical loss-resilient codes. Proc of the 29th ACM Symposium on Theory of Computing, El Paso, Texas, United States, May, New York, USA: ACM, 1997, 150-159.
  • 3Luby M, Mitzenmacher M, Shokrollahi MA, et al. Efficient erasure correcting codes. IEEE Trans Inform. Theory, 2001, 47(2) : 569-584.
  • 4Shokrollahi MA. New sequences of linear time erasure codes approaching the channel capacity. In: Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Berlin, Germany: SpringerVerlag, 1999, 1719: 65-76.
  • 5Oswald P, Shokrollahi MA. Capacity-achieving sequences for the erasure channel. IEEE Trans Inform Theory, 2002, 48(12) : 3017-3028.
  • 6Di C, Proietti D, Telatar IE, et al. Finite length analysis of lowdensity parity-check codes on the binary erasure channel. IEEE Trans Inform Theory, 2002, 48(6): 1570-1579.
  • 7Pishro-Nik H, Fekri F. On decoding of low-density parity-check codes over the binary erasure channel. IEEE Trans Inform Theory, 2004, 50(3) : 439-454.
  • 8Gallager RG. Low Density Parity Check Codes. Cambridge, Massachusetts: MIT Press, 1963.
  • 9Byers JW, Luby M, Mitzenmacher M, et al. A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM Computer Communication Review, 1998, 28(4): 56-67.
  • 10Maymounkov P, Mazoeres D. Rateless codes and big downloads. In: Proceedings of the 2nd Int Workshop Peer-to-Peer Systems (IPTPS'03), Berkeley, USA, February, Germany: SpringerVerlag, USA, 2003, 1-6.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部