有理函数域上的最优局部恢复码的构造  

The Optimal Local Recovery Codeon the Rational Function Field

作　　者：陈子星 CHEN Zixing(School of Mathematics and Computational Sciences,Anqing Normal University,Anqing 246133,China)

机构地区：[1]安庆师范大学数学与计算科学学院,安徽安庆246133

出　　处：《宿州学院学报》2020年第8期76-78,84,共4页Journal of Suzhou University

摘　　要：局部恢复码(LRC)是擦除编码的一种。现代分布式存储系统为减少存储开销,将擦除编码技术应用到系统中。代数曲线构造LRC的过程复杂,为简化过程,研究在一个符号丢失的情况下,在代数函数域上构造LRC。在有理函数域上应用此构造方法构造出了距离最优的LRC,并且在F13上构造了一个距离最优的12,6,3 LRC码,为现代分布式存储系统提供了更可靠有效的数据。Local recovery code( LRC) is a kind of erasure code. In order to reduce the storage cost,modern distributed storage system applies erasure code technology to the system. LRC is constructed by algebraic curves and the process is complex. In order to simplify it,the construction of local recovery code in algebraic function field is studied in the case of a symbol loss. The method in the rational function field is used to construct a LRC and a code with optimal distance(12,6,3) on F13 which provides more reliable and effective data for modern distributed storage system.

关 键 词：局部恢复码 有理函数域 代数函数域 

分 类 号：O29[理学—应用数学]