Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T23:02:43.541Z Has data issue: false hasContentIssue false

A NOTE ON k-GALOIS LCD CODES OVER THE RING $\mathbb {F}_{\mathbf{\mathit{q}}}\boldsymbol{+}\mathbf{\mathit{u}}\mathbb {F}_{\mathbf{\mathit{q}}}$

Published online by Cambridge University Press:  14 December 2020

RONGSHENG WU
Affiliation:
Ministry of Education Key Laboratory of Intelligent Computing and Signal Processing, School of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, P. R. China e-mail: wrs2510@163.com
MINJIA SHI*
Affiliation:
Ministry of Education Key Laboratory of Intelligent Computing and Signal Processing, School of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, P. R. China
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

MSC classification

Information

Type
Research Article
Copyright
© 2020 Australian Mathematical Publishing Association Inc.