计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (24): 11-13.DOI: 10.3778/j.issn.1002-8331.2009.24.004

• 博士论坛 • 上一篇    下一篇

Lamda码:一种新的纠双删阵列码

罗 迅   

  1. 湖南师范大学 数学与计算机科学学院,长沙 410081
  • 收稿日期:2009-05-22 修回日期:2009-06-23 出版日期:2009-08-21 发布日期:2009-08-21
  • 通讯作者: 罗 迅

Lamda code:MDS double-erasure correcting array code

LUO Xun   

  1. College of Mathematics and Computer Science,Hunan Normal University,Changsha 410081,China
  • Received:2009-05-22 Revised:2009-06-23 Online:2009-08-21 Published:2009-08-21
  • Contact: LUO Xun

摘要: 为了解决集成存储系统或者分布式存储系统中的数据安全问题,提出了一种新的阵列码,名为Lamda码。Lamda码可以同时恢复最多两个删除错,或者纠正一个突发错误。该码是极大距离可分码(MDS),因此理论上具有最优的空间效率,并附有相应的证明。详细描述了编码算法与解码算法,同时讨论了相应算法的复杂度问题。结论表明,Lamda码也是一种有效的数据冗余方案。

Abstract: An array code is proposed named as Lamda code.The code is for correcting double erasures or one single burst error.It is also a Maximum Distance Separable(MDS) code and thus is optimal in storage efficiency.The encoding and decoding algorithms are described.The complexity of the algorithms is also discussed.Lamda code is another meaningful way for data reliability.

中图分类号: