巢湖学院学报 ›› 2021, Vol. 23 ›› Issue (6): 72-75+84.doi: 10.12152/j.issn.1672-2868.2021.06.010

• 数理科学 • 上一篇    下一篇

特征为3的有限域上最优LRC码

陈晓辉,胡万宝:安庆师范大学 数理学院   

  1. 安庆师范大学 数理学院,安徽 安庆 246133
  • 收稿日期:2021-08-16 出版日期:2021-11-25 发布日期:2022-03-06
  • 作者简介:陈晓辉(1996—),男,安徽合肥人,安庆师范大学数理学院硕士研究生,主要从事代数编码研究。

Optimal LRC Codes over Finite Fields with Characteristic 3

CHEN Xiao-hui,HU Wan-bao:School of Mathematics and Physics, Anqing Normal University   

  1. School of Mathematics and Physics, Anqing Normal University, Anqing Anhui 246133
  • Received:2021-08-16 Online:2021-11-25 Published:2022-03-06

摘要: 局部恢复(LRC)码是一类线性码,当码字中某个分量的值丢失时,可通过访问该码字中其他少数(至多r个)分量来恢复。首先在有限域F27上分别运用加法子群和乘法子群作陪集的方法构造LRC码,并且得出这些LRC码是最优的;进一步推广到特征为3的一般有限域F3l上来构造一簇最优LRC码。最后,将构造的这些码与同类最新成果的LRC码的局部恢复性进行比较,结果表明,构造的LRC码具有更好的局部恢复性。

关键词: 有限域, 局部恢复码, 特征

Abstract: Local recovery codes(LRC)are a class of linear codes. When the value of a component in the codeword is lost, it can be recovered by accessing a few (at most r) other components in the codeword. In this paper, we first construct LRC codes by using additive subgroups and multiplication subgroups as cosets on finite field F27, and obtain that these LRC codes are optimal; Furthermore, we generalize to construct a cluster of optimal LRC codes for a general finite field F3l with characteristic 3. Finally, the local resilience of these codes is compared with the latest LRC codes of the same kind. The results show that the constructed LRC codes have better local resilience.

Key words: finite field, local recovery code, characteristic

中图分类号: 

  • O157.4