Symplectic Hulls over a Non-Unital Ring

arXiv:2601.06609 · cs.IT, math.IT · Submitted 2026-01-10 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: I'm Tom.

Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.

Tom: We're looking at the paper: "Symplectic Hulls over a Non-Unital Ring".

Paper summary: Jane: So, to summarize the main thesis of "Symplectic Hulls over a Non-Unital Ring," the authors are focusing on the symplectic hulls defined over a non-unital ring E. They start by defining this ring E with four elements and its multiplication table.

Tom: The paper claims that they can identify the residue and torsion codes for all three types of symplectic hulls—the left, right, and two-sided duals—and they characterize the generator matrix for the two-sided symplectic hull of a free E linear code.

Lu: They then explore what happens when you take the sum of two free E linear codes and look at its symplectic hull.

Meng: The core idea is that they're providing tools to extend a free E linear code of smaller length and symplectic hull rank to one of larger length and symplectic hull rank using specific build-up techniques.

Lalam: Construction one uses a generator matrix for the residue code, while construction two takes a parity check matrix from the residue code’s parity check matrix, leading to a new code with an increased symplectic hull rank.

Jane: They also discuss permutation equivalence for free E linear codes, stating that they are equivalent if and only if their residue codes are permutation equivalent. Plus, they investigate the symplectic hull-variation problem when you have two permutation equivalent free E linear codes and their length product is specific.

Tom: The ultimate result of this study is the classification of the inequivalent free E linear optimal codes with symplectic hull rank up to four. That’s a concrete set of constraints they are working with.

Meng: So, what this means for us in terms of real-world deployment is that we now have more precise mathematical tools to analyze the complexity and scalability of codes built on these specific algebraic structures.

Lalam: It gives us a way to systematically extend existing code families, which is a very useful skill when developing new error correction methods.

Conclusion: Jane: So, looking at the title "Symplectic Hulls over a Non-Unital Ring," it seems like the authors are setting up a specific area of investigation that hadn't been heavily explored before in coding theory literature.

Tom: They tackle this by defining the ring E and then systematically investigating all three symplectic hulls—left, right, and two-sided—to characterize their associated residue and torsion codes.

Lu: The implication is that for any non-unital ring you work with, these hull properties might follow a predictable pattern that we can leverage for constructing larger codes.

Meng: For the practical application of this paper, it provides methods to systematically extend smaller free E linear codes into longer ones while managing the symplectic hull rank efficiently. That’s how you handle scaling in a way that keeps complexity under control.

Lalam: And by classifying optimal codes up to rank four, they give us a finite set of concrete examples for systems where this structure is relevant and we can analyze their performance constraints.

Jane: So, it moves the field forward by addressing this gap in research on non-unital rings and providing actionable techniques for extending codes over these structures.

Tom: It’s a focused piece of work that builds the necessary tools for anyone interested in applying these specific algebraic properties to larger code constructions.

ANUP KUSHWAHA, OM PRAKASH

Indian Institute of Technology Patna

cs.IT, math.IT

Submitted: 2026-01-10

Updated: 2026-11-18

Comments: 24

License: http://creativecommons.org/licenses/by/4.0/

The gist: Symplectic hulls over a non-unital ring presents an investigation into the symplectic hulls of codes over a specific non-unital ring E =⟨κ, τ 2κ = 2τ = 0, κ2 = κ, τ2 = τ, κτ = κ…

Key concepts

Ring E
E is a non-unitary ring with four elements defined by specific relations (2κ=2τ=0, κ^2=κ, τ^2=τ, κτ=κ, τκ=τ). It has a unique maximal ideal J and a residue field F2. This structure dictates the properties of the codes studied.
Residue Code (CRes)
The residue code is derived from an E-linear code C by reducing its elements modulo the maximal ideal J to the residue field F2. This process simplifies the code structure, allowing researchers to analyze its relationship with other hull properties and duals.
Torsion Code (CT)
The torsion code captures information about a specific quotient of F2n/2. It is defined by checking if an element v in this quotient belongs to the code C, specifically when vζ ∈ C, where ζ is the sum of κ and τ. This code helps characterize freeness and dual properties.
Symplectic Hull-Rank
The symplectic hull-rank measures a property related to the structure of the symplectic hulls of an E-linear code. The paper calculates this rank for different codes and uses it to classify inequivalent optimal free E-linear codes, providing a metric for comparing their structural complexity.

Terminology

Summary

Symplectic hulls over a non-unital ring presents an investigation into the symplectic hulls of codes over a specific non-unital ring E =⟨κ, τ 2κ = 2τ = 0, κ2 = κ, τ2 = τ, κτ = κ, τκ = τ⟩ and explores related properties such as residue and torsion codes. p. 0

Where the paper says it

SYMPLECTIC HULLS OVER A NON-UNITAL RING ANUP KUSHWAHA AND OM PRAKASH∗ Abstract. This paper presents the study of the symplectic hulls over a nonunital ring E = ⟨κ, τ | 2κ = 2τ = 0, κ2 = κ, τ 2 = τ, κτ = κ, τκ = τ⟩.

The paper is significant because it addresses research gaps concerning symplectic hulls over non-unital rings and provides build-up techniques for extending free E-linear codes. p. 1
Where the paper says it

While plenty of works on Euclidean hulls are available [8, 11, 22, 26, 28, 32], there are a very few works that dealt with symplectic hulls [20, 33]. In fact, the following research gaps motivate us to present the current paper on symplectic hulls over a non-unital ring E = ⟨κ, τ | 2κ = 2τ = 0, κ2 = κ, τ 2 = τ, κτ = κ, τκ = τ ⟩: • Over the past five years, researchers have shown a growing interest in exploring various families of codes over non-unital rings [1, 3, 9, 16, 24].

Code Definitions and Ring Structure

The ring E is characterized as a non-unitary ring with 4 elements, denoted by E =⟨κ, τ 2κ = 2τ = 0, κ2 = κ, τ2 = τ, κτ = κ, τκ = τ⟩. It is a local ring with a unique maximal ideal J =⟨0, ζ⟩ where ζ=κ + τ. p. 2

Where the paper says it

· 0 κ τ ζ 0 0 0 0 0 κ 0 κ κ 0 τ 0 τ τ 0 ζ 0 ζ ζ 0 From the multiplication table, it follows that the ring E is non-unitary and possesses a unique maximal ideal J = {0, ζ}. Consequently, E is a local ring, and its residue field is E/J = F2.

The residue field of E is E/J = F2. p. 2
Where the paper says it

· 0 κ τ ζ 0 0 0 0 0 κ 0 κ κ 0 τ 0 τ τ 0 ζ 0 ζ ζ 0 From the multiplication table, it follows that the ring E is non-unitary and possesses a unique maximal ideal J = {0, ζ}. Consequently, E is a local ring, and its residue field is E/J = F2.

For an E-linear code C of length 2n, the residue code CRes is defined as CRes = π(z) z ∈ C where π: E → F2 is the reduction modulo J. p. 2
Where the paper says it

(1) Residue code: The residue code of C, denoted by CRes, is defined by CRes = {π(z) | z ∈ C}. (2) Torsion code: The F2-linear code defined by CT or = {v ∈ F 2n 2 | vζ ∈ C}, is called the torsion code of an E-linear code C of length 2n.

The torsion code CT or is defined by CT or = v ∈ F2n/2 vζ ∈ C. p. 2
Where the paper says it

(1) Residue code: The residue code of C, denoted by CRes, is defined by CRes = {π(z) | z ∈ C}. (2) Torsion code: The F2-linear code defined by CT or = {v ∈ F 2n 2 | vζ ∈ C}, is called the torsion code of an E-linear code C of length 2n.

Symplectic Duals and Hull Properties

The left, right, and two-sided symplectic duals of an E-linear code C are denoted by C⊥SL, C⊥SR, and C⊥S respectively. The freeness of an E-linear code is characterized by the condition CT or = 0, which means k2 = 0. p. 3

Where the paper says it

A parity-check matrix of C refers to a generator matrix of C ⊥S . The freeness of an E-linear code C is characterized by the condition CRes = CT or.

Theorem 3.3 states that C⊥SL is always free but C⊥SR is never free. p. 4
Where the paper says it

Now, we check the freeness of the three symplectic duals of an E-linear code. If C is an E-linear code, then C ⊥SL is always free but C ⊥SR is never free.

The two-sided symplectic dual is denoted by C⊥s = C⊥SL ∩C⊥SR. p. 3
Where the paper says it

Consequently, the left and right symplectic duals of an E-code C, denoted by C ⊥SL and C ⊥SL , respectively, are the E-linear codes given by C ⊥SL = {z ∈ E 2n | ⟨z, w⟩s = 0, ∀ w ∈ C}, and C ⊥SR = {z ∈ E 2n | ⟨w, z⟩s = 0, ∀ w ∈ C}. The intersection of the above two symplectic duals is called the two-sided symplectic dual, and is denoted by C ⊥s , i.

Symplectic Hulls Characterization

Theorem 3.4 provides a result for the residue and torsion codes of the three symplectic hulls of an E-linear code C. p. 5

Where the paper says it

Therefore, CRes = CT or, and hence C is free. □ The following result calculates the residue and torsion codes of the three symplectic hulls of an E-linear code.

Specifically, it states that (LSHull(C))Res = CRes ∩ (CRes)⊥S and (LSHull(C))T or = (CRes)⊥S ∩ CT or. p. 5
Where the paper says it

□ The following result calculates the residue and torsion codes of the three symplectic hulls of an E-linear code. For an E-linear code C, (1) (LSHull(C))Res = CRes ∩ (CRes) ⊥S and (LSHull(C))T or = (CRes) ⊥S ∩ CT or; (2) (RSHull(C))Res = CRes ∩ (CT or) ⊥S and (RSHull(C))T or = CT or; (3) (SHull(C))Res = CRes ∩(CT or) ⊥S and (SHull(C))T or = (CRes) ⊥S ∩CT or.

The theorem also yields Corollary 1, which gives the structure of the duals in terms of CRes and CT or. p. 5
Where the paper says it

Thus, (SHull(C))Res = CRes∩(CT or) ⊥S and (SHull(C))T or = (CRes) ⊥S ∩ CT or. □ The above theorem immediately yields the following important corollary.

Build-up Constructions

The paper proposes two build-up construction techniques to extend a free E-linear code with a smaller length and symplectic hull-rank to one of larger length and symplectic hull-rank. Construction I involves using a generator matrix G′ for the residue code DRes, where rank(G′omega2n+2G T1) = rank(Gomega2nGT). p. 3

Where the paper says it

The residue and torsion codes of these symplectic hulls are calculated, and their basic properties are discussed. Further, we characterize the form of a generator matrix of the two-sided symplectic hull of a free E-linear code and compute the corresponding symplectic hull-rank.

Construction II involves a parity-check matrix H' derived from the parity-check matrix H of CRes, leading to a code D with symplectic hull-rank l + 1.

Hull Variation and Optimality

The study investigates the permutation equivalence of free E-linear codes, showing that they are permutation-equivalent if and only if their residue codes are permutation-equivalent. Theorem 5.2 shows that for two permutation-equivalent free E-linear codes D = CP, their symplectic hull-ranks remain invariant if Pomega2nP T = omega2n. p. 1

Where the paper says it

This research gap motivated us to propose two build-up construction techniques over the non-unital ring E that extend a free E-linear code with a smaller length and symplectic hull-rank to one of larger length and symplectic hull-rank. • The length and dimension of permutation-equivalent linear codes are always identical [13], but they need not be equal in their duals [7].

The paper concludes by classifying the inequivalent free E-linear optimal codes with symplectic hull-rank up to 4. p. 9
Where the paper says it

Therefore, if G is a generator matrix of the symplectic hull of CRes, then κG is a generator matrix of SHull(C). □ The next result is essential for classifying optimal free E-linear codes, as it calculates the symplectic hull-rank.

Conclusion

The manuscript investigates the three symplectic hulls of an Elinear code, calculates the symplectic hull-rank, and proposes build-up constructions for extending codes. It also discusses permutation equivalence and classifies optimal free E-linear codes with prescribed symplectic hull-rank. p. 1

Where the paper says it

Section 4 provides two build-up construction techniques over the ring E and also gives some illustrative examples. Section 5 discusses the permutation equivalence and investigates the symplectic hull-variation problem for free E-linear codes and also classifies free E-linear optimal codes for lengths up to 4.

The work provides a foundation for future research into other non-unital rings appearing in Fine’s classification. p. 1
Where the paper says it

Section 6 concludes the work with some possible future directions. Preliminaries The noncommutative ring E = ⟨κ, τ | 2κ = 2τ = 0, κ2 = κ, τ 2 = τ, κτ = κ, τκ = τ ⟩ appeared in the classification of Fine [12], is a non-unitary ring with 4 elements.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Enhanced capability in symplectic hull analysis over non-unital rings allows AI to identify residue and torsion codes for left, right, and two-sided symplectic hulls based on specific ring structures like E = .

  2. Improved ability to characterize the generator matrix of the two-sided symplectic hull of a free E-linear code and compute its corresponding symplectic hull rank.

  3. Capacity to explore and apply two build-up construction techniques that extend a free E-linear code with smaller length and symplectic hull rank to one of larger length and symplectic hull rank.

  4. Advanced analysis of permutation equivalence for free E-linear codes, specifically investigating the symplectic hull variation problem and determining when permutation equivalence implies equality of symplectic hull ranks.

  5. Precision in classifying optimal codes by applying theorems to determine the classification of free E-linear optimal codes with a prescribed symplectic hull rank up to length 4.

  6. Ability to verify duality properties for E-linear codes, such as (C+D)⊥S = C⊥S ∩ D⊥S, and conclude when the sum of two symplectic LCD E-codes is also a symplectic LCD code using Theorem 3.16.

  7. Functionality to calculate the rank of the symplectic hull of the sum of two free E-linear codes by utilizing Theorem 3.16: rank(SHull(C + D)) = l1 + l2 − l, where l is the rank of SHull(C) ∩ SHull(D).

  8. Implementation of techniques to construct free E-linear codes with larger lengths and symplectic hull ranks from smaller ones using Construction I and Construction II, as exemplified by Example 2 and Example 3.

Abstract

This paper presents the study of the symplectic hulls over a non-unital ring E= κ,τ 2 κ=2 τ=0, κ 2=κ, τ 2=τ, κτ=κ, τκ=τ. We first identify the residue and torsion codes of the left, right, and two-sided symplectic hulls, and characterize the generator matrix of the two-sided symplectic hull of a free E-linear code. Then, we explore the symplectic hull of the sum of two free E-linear codes. Subsequently, we provide two build-up techniques that extend a free E-linear code of smaller length and symplectic hull-rank to one of larger length and symplectic hull-rank. Further, for free E-linear codes, we discuss the permutation equivalence and investigate the symplectic hull-variation problem. An application of this study is given by classifying the free E-linear optimal codes for smaller lengths.

Sources

Related papers