# Galois LCD Codes Over Fq + uFq + vFq + uvFq

Source: [Galois LCD Codes Over Fq + uFq + vFq + uvFq](<https://www.sota2.com/research/paper/68fa595b1e209131ce9b6587>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:52:13.471Z

Authors: Astha Agrawal, Gyanendra K. Verma, R. K. Sharma

Published: 2022-06-17T12:24:09.000Z

## Abstract

In \\cite{anote}, Wu and Shi studied $ l $-Galois LCD codes over finite chain ring $\\mathcal{R}=\\mathbb{F}\_q+u\\mathbb{F}\_q$, where $u^2=0$ and $ q=p^e$ for some prime $p$ and positive integer $e$. In this work, we extend the results to the finite non chain ring $ \\mathcal{R} =\\mathbb{F}\_q+u\\mathbb{F}\_q+v\\mathbb{F}\_q+uv\\mathbb{F}\_q$, where $u^2=u,v^2=v $ and $ uv=vu $. We define a correspondence between $ l $-Galois dual of linear codes over $ \\mathcal{R} $ and $ l $-Galois dual of its component codes over $ \\mathbb{F}\_q .$ Further, we construct Euclidean LCD and $ l $-Galois LCD codes from linear code over $ \\mathcal{R} $. This consequently leads us to prove that any linear code over $ \\mathcal{R} $ is equivalent to Euclidean ($ q\>3 $) and $ l $-Galois LCD ($0\<l\<e$, and $p^{e-l}+1\\mid p^e-1$) code over $ \\mathcal{R} .$ Finally, we investigate MDS codes over $ \\mathcal{R} .$

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2206.08725>)

[PDF](<https://arxiv.org/pdf/2206.08725.pdf>)
