Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ahmad et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: