Asymptotically Good Additive Cyclic Codes  

作　　者：YAO Ting ZHU Shixin KAI Xiaoshan 

机构地区：[1]School of Mathematics,Hefei University of Technology,Hefei 230601,China

出　　处：《Chinese Journal of Electronics》2020年第5期859-864,共6页电子学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.61772168,No.61972126)。

摘　　要：ZpZpa-additive cyclic codes have been proved to be asymptotically good by Yao and Zhu.For binary Hamming scheme,we introduce a type of Z2(Z2+UZ2)-additive cyclic codes genera ted by pairs of polynomials.Let R be the chain ring Z2+uZ2,where u2=0.The asymptotic rates and relative distances of this class of codes are presen ted by establishing the relationship between the random Z2-R-additive cyclic code and random binary quasi-cyclic code of index 2.We show that Z2fladditive cyclic codes are asymptotically good.

关 键 词：Additive cyclic codes Random codes Relative minimum distance Asymptotically good codes. 

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