Physical-Symbol Duality and Delsarte Theory for Semisimple Mixed-Alphabet Codes

Let q be an odd prime power, P=Fq[v]/⟨v2−τ2v⟩ and Q=Fq[u,v]/⟨u3−τ12u,v2−τ2v⟩ with τ1τ2≠0. We study Q-submodules of Fqn×Pm×Qk under the symbol metric, that is, the Hamming metric of the mixed alphabet, in which a nonzero P- or Q-coordinate is one symbol error, rather than under the Hamming metric of the Gray image. The metric space is the product Hamming scheme H(n,q)⊗H(m,q2)⊗H(k,q6). We write the Q-valued module dual in the original coordinates and prove that, for submodules, it equals the character annihilator of this scheme; examples show that the submodule hypothesis and the idempotent weights are both necessary. Specializing Delsarte’s theory, we give a three-block MacWilliams identity with explicit eigenmatrices, prove that the one-variable symbol enumerator is not closed under duality, and treat linear-programming, Singleton, Hamming and Plotkin bounds. Our main structural result reduces the minimum distance, the dual distance, the orthogonal-array strength profile and the maximal size of a Q-submodule to six classical linear codes over Fq; hence, Singleton-optimal submodules are exactly those with MDS constituents, and submodules can be strictly smaller than Fq-linear codes. A channel model, mixed split orthogonal arrays, exact examples and numerical comparisons with known bounds are included.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2026-11-17
DOI
https://doi.org/10.3390/axioms15110856
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Physical-Symbol Duality and Delsarte Theory for Semisimple Mixed-Alphabet Codes

Nabilah Hani Abughazalah, Abu Zaid Ansari, Faiza Shujat, Mukhtar Ahmad
3 links
Axioms
Coding theory and cryptography
article

Physical-Symbol Duality and Delsarte Theory for Semisimple Mixed-Alphabet Codes

Nabilah Hani Abughazalah, Abu Zaid Ansari, Faiza Shujat, Mukhtar Ahmad
article en

Abstract

Let q be an odd prime power, P=Fq[v]/⟨v2−τ2v⟩ and Q=Fq[u,v]/⟨u3−τ12u,v2−τ2v⟩ with τ1τ2≠0. We study Q-submodules of Fqn×Pm×Qk under the symbol metric, that is, the Hamming metric of the mixed alphabet, in which a nonzero P- or Q-coordinate is one symbol error, rather than under the Hamming metric of the Gray image. The metric space is the product Hamming scheme H(n,q)⊗H(m,q2)⊗H(k,q6). We write the Q-valued module dual in the original coordinates and prove that, for submodules, it equals the character annihilator of this scheme; examples show that the submodule hypothesis and the idempotent weights are both necessary. Specializing Delsarte’s theory, we give a three-block MacWilliams identity with explicit eigenmatrices, prove that the one-variable symbol enumerator is not closed under duality, and treat linear-programming, Singleton, Hamming and Plotkin bounds. Our main structural result reduces the minimum distance, the dual distance, the orthogonal-array strength profile and the maximal size of a Q-submodule to six classical linear codes over Fq; hence, Singleton-optimal submodules are exactly those with MDS constituents, and submodules can be strictly smaller than Fq-linear codes. A channel model, mixed split orthogonal arrays, exact examples and numerical comparisons with known bounds are included.

AxiomsVol. 15(11)
Princess Nourah bint Abdulrahman University (SA), Bandung Institute of Technology (ID), Taibah University (SA), Islamic University of Madinah (SA)
Princess Nourah Bint Abdulrahman University
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