具有多恢复集的局部恢复码的构造  

Construction of Local Recovery Codes with Multiple Recovery Sets

作　　者：胡万宝 钱隆 HU Wan-bao;QIAN Long(School of Mathematics and Science,Anqing Normal University,Anqing 246133,China)

机构地区：[1]安庆师范大学数理学院,安徽安庆246133

出　　处：《数学的实践与认识》2023年第3期271-275,共5页Mathematics in Practice and Theory

摘　　要：局部恢复码(LRC)是指码字的任意一个坐标位置的值都可以通过较少的r个其它位置的值来恢复.构造具有多恢复集的LRC码是为了解决通信中节点访问的拥堵问题.基于代数函数域上的自同构群,利用其子群的内直积构造多恢复集,进而构造出具有多恢复集的局部恢复码.此外,在恢复码的构造中,赋值空间的生成集是显式表达的,这使得码的维数、最小距离等参数计算非常方便.Local recovery code(LRC)refers to the value of any coordinate position of the code word can be recovered by a smaller number of rother positions.LRC codes with multiple recovery sets are constructed to solve the congestion problem of node access in communication.In this paper,based on automorphism groups on the algebraic function fields,we use the inner direct product of their subgroups and then construct local recovery codes with multiple recovery sets.Moreover,in the construction of the recovery code,the generating set of the assignment space shows the expression,which makes dimension and minimum distance of the code very convenient.

关 键 词：代数函数域 局部恢复码(LRC) 自同构群 

分 类 号：O157.4[理学—数学]