Symplectic Galois-LCD Codes over FqvFq and Duality-Preserving Gray Maps+

We study symplectic Galois-LCD codes over the finite non-chain ring R=Fq+vFq, where v2=v. Using the constituent decomposition of R, we characterize their symplectic Galois duals and hulls and obtain a generator-matrix criterion for free codes. For Gray maps defined by nonsingular 2×2 matrices, we prove that k-Galois quasi-orthogonality is necessary and sufficient for the same Gray map to preserve symplectic k-Galois duality for every pair of constituent codes. We further show that each such matrix is a nonsingular diagonal multiple of a matrix over Fix(τk2), and obtain their complete classification and exact enumeration. Finally, we derive a symplectic distance bound for the corresponding matrix-product Gray images. We show that the bound is attained for nested constituent codes when all entries of the defining matrix are nonzero. In the ordinary symplectic case, we construct EAQEC codes and determine the exact minimum distance of an explicit example.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-11-13
DOI
https://doi.org/10.3390/math14224180
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Symplectic Galois-LCD Codes over FqvFq and Duality-Preserving Gray Maps+

Yunbo Tian, Juan Li, Yichen Sun
Mathematics
Coding theory and cryptography
article

Symplectic Galois-LCD Codes over FqvFq and Duality-Preserving Gray Maps+

Yunbo Tian, Juan Li, Yichen Sun
article en

Abstract

We study symplectic Galois-LCD codes over the finite non-chain ring R=Fq+vFq, where v2=v. Using the constituent decomposition of R, we characterize their symplectic Galois duals and hulls and obtain a generator-matrix criterion for free codes. For Gray maps defined by nonsingular 2×2 matrices, we prove that k-Galois quasi-orthogonality is necessary and sufficient for the same Gray map to preserve symplectic k-Galois duality for every pair of constituent codes. We further show that each such matrix is a nonsingular diagonal multiple of a matrix over Fix(τk2), and obtain their complete classification and exact enumeration. Finally, we derive a symplectic distance bound for the corresponding matrix-product Gray images. We show that the bound is attained for nested constituent codes when all entries of the defining matrix are nonzero. In the ordinary symplectic case, we construct EAQEC codes and determine the exact minimum distance of an explicit example.

MathematicsVol. 14(22)
Linyi University (CN)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon