当前位置:
X-MOL 学术
›
Bull. Aust. Math. Soc.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
A NOTE ON k-GALOIS LCD CODES OVER THE RING
Bulletin of the Australian Mathematical Society ( IF 0.6 ) Pub Date : 2020-12-14 , DOI: 10.1017/s0004972720001331 RONGSHENG WU , MINJIA SHI
Bulletin of the Australian Mathematical Society ( IF 0.6 ) Pub Date : 2020-12-14 , DOI: 10.1017/s0004972720001331 RONGSHENG WU , MINJIA SHI
We study the k -Galois linear complementary dual (LCD) codes over the finite chain ring $R=\mathbb {F}_q+u\mathbb {F}_q$ with $u^2=0$ , where $q=p^e$ and p is a prime number. We give a sufficient condition on the generator matrix for the existence of k -Galois LCD codes over R . Finally, we show that a linear code over R (for $k=0, q> 3$ ) is equivalent to a Euclidean LCD code, and a linear code over R (for $0<k<e$ , $(p^{e-k}+1)\mid (p^e-1)$ and ${(p^e-1)}/{(p^{e-k}+1)}>1$ ) is equivalent to a k -Galois LCD code.
中文翻译:
关于环上 k-GALOIS LCD 代码的说明
我们研究ķ -有限链环上的伽罗瓦线性互补对偶(LCD)码 $R=\mathbb {F}_q+u\mathbb {F}_q$ 和 $u^2=0$ , 在哪里 $q=p^e$ 和p 是一个素数。我们给出了生成矩阵存在的充分条件ķ -Galois LCD 代码结束R . 最后,我们证明了一个线性码R (为了 $k=0, q> 3$ ) 等价于欧几里得 LCD 码,而线性码在R (为了 $0<k<e$ , $(p^{ek}+1)\mid (p^e-1)$ 和 ${(p^e-1)}/{(p^{ek}+1)}>1$ ) 等价于ķ -伽罗瓦 LCD 代码。
更新日期:2020-12-14
中文翻译:
关于环上 k-GALOIS LCD 代码的说明
我们研究