检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:卢亚琪 施敏加[1] 伍文婷 肖阿琴 LU Yaqi;SHI Minjia;WU Wenting;XIAO Aqing(School of Mathematical Sciences, Anhui University, Hefei 230601, China)
出 处:《中国科学技术大学学报》2018年第11期890-897,共8页JUSTC
基 金:Supported by National Natural Science Foundation of China(61672036);Excellent Youth Foundation of Natural Science Foundation of Anhui Province(1808085J20)
摘 要:主要研究q为素数的方幂时非链环F_q+uF_q+vF_q+uvF_q,u^2=v^2=0,uv=vu上长度为2n的双循环码.对于给定的正整数n,给出了自对偶和LCD双循环码个数的精确计算公式.利用保距的Gray映射,构造了q为偶数时有限域F_q上长度为8n的自对偶码和LCD码.基于给定的n和q的精确计数公式,由随机编码理论和Artin猜想,得到了关于所研究码的相对距离的修订Varshamov Gilbert界.Double circulant codes of length 2n over a non-chain ring F q+u F q+v F q+uv F q, u 2=v 2=0, uv=vu, were studied when q was a prime power. Exact enumerations of self-dual and LCD double circulant codes for a positive integer n were given. Using a distance-preserving Gray map, self-dual and LCD codes of length 8n over F q were constructed when q was even. Using random coding and the Artin conjecture, the modified Varshamov-Gilbert bounds were derived on the relative distance of the codes considered, building on exact enumeration results for given n and q.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.126.145