Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic

preprint2026arXivOpen access

Abstract

Let Re,m\mathscr{R}_{e,m} denote a finite commutative chain ring of even characteristic with maximal ideal ⟨u⟩\langle u \rangle of nilpotency index e≥3,e \geq 3, Teichmu¨\ddot{u}ller set Tm,\mathcal{T}_{m}, and residue field Re,m/⟨u⟩\mathscr{R}_{e,m}/\langle u \rangle of order 2m.2^m. Suppose that 2∈⟨uκ⟩∖⟨uκ+1⟩2 \in \langle u^κ\rangle \setminus \langle u^{κ+1}\rangle for some odd integer κκ with 3≤κ≤e.3 \leq κ\leq e. In this paper, we first develop a recursive method to construct a self-orthogonal code De\mathscr{D}_e of type {λ1,λ2,…,λe}\{λ_1, λ_2, \ldots, λ_e\} and length nn over Re,m\mathscr{R}_{e,m} from a chain C(1)⊆C(2)⊆⋯⊆C(⌈e2⌉)\mathcal{C}^{(1)}\subseteq \mathcal{C}^{(2)} \subseteq \cdots \subseteq \mathcal{C}^{(\lceil \frac{e}{2} \rceil)} of self-orthogonal codes of length nn over Tm,\mathcal{T}_{m}, and vice versa, subject to certain conditions, where λ1,λ2,…,λeλ_1,λ_2,\ldots,λ_e are non-negative integers satisfying 2λ1+2λ2+⋯+2λe−i+1+λe−i+2+λe−i+3+⋯+λi≤n2λ_1+2λ_2+\cdots+2λ_{e-i+1}+λ_{e-i+2}+λ_{e-i+3}+\cdots+λ_i \leq n for ⌈e+12⌉≤i≤e,\lceil \frac{e+1}{2} \rceil \leq i\leq e, and ⌊⋅⌋\lfloor \cdot \rfloor and ⌈⋅⌉\lceil \cdot \rceil denote the floor and ceiling functions, respectively. This construction ensures that Tori(De)=C(i)Tor_i(\mathscr{D}_e)=\mathcal{C}^{(i)} for 1≤i≤⌈e2⌉.1 \leq i \leq \lceil \frac{e}{2} \rceil. With the help of this recursive construction method and by applying results from group theory and finite geometry, we obtain explicit enumeration formulae for all self-orthogonal and self-dual codes of an arbitrary length over Re,m.\mathscr{R}_{e,m}. We also illustrate these results with some examples.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.