Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 28 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Galois LCD Codes Over Fq + uFq + vFq + uvFq (2206.08725v1)

Published 17 Jun 2022 in cs.IT and math.IT

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 $u2=0$ and $ q=pe$ 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 $u2=u,v2=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 pe-1$) code over $ \mathcal{R} .$ Finally, we investigate MDS codes over $ \mathcal{R} .$

Citations (1)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

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