Papers
Topics
Authors
Recent
Search
2000 character limit reached

Galois LCD Codes Over Fq + uFq + vFq + uvFq

Published 17 Jun 2022 in cs.IT and math.IT | (2206.08725v1)

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

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.