Weak Composition Lattices and Ring-Linear Anticodes

📅 2026-01-12
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This study investigates linear codes over the ring $\mathbb{Z}/p^s\mathbb{Z}$ under the Lee metric, with a focus on characterizing the structure and combinatorial properties of optimal antipodal codes. By introducing the notions of weak composition lattices and dominance order, the authors construct for the first time a lattice framework for linear antipodal codes in the Lee metric over rings and establish a bijection between optimal antipodal codes and weak composition lattices. This approach not only fully captures the algebraic and combinatorial features of optimal antipodal codes but also yields new code invariants, thereby providing a novel toolkit for the classification and construction of linear codes over finite rings.

Technology Category

Constraint Satisfaction and Optimization: Other Foundations of Constraint SatisfactionSearch and Optimization: Combinatorial OptimizationMachine Learning: Learning with Manifolds

Application Category

Security and Privacy: Applications of cryptographyGraph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphsEconomics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
📝 Abstract
Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works connecting lattice theory, anticodes, and coding-theoretic invariants, we investigate ring-linear codes endowed with the Lee metric. We introduce and characterize optimal Lee-metric anticodes over the ring $\mathbb{Z}/p^s\mathbb{Z}$. We show that the family of such anticodes admits a natural partition into subtypes and forms a lattice under inclusion. We establish a bijection between this lattice and a lattice of weak compositions ordered by dominance. As an application, we use this correspondence to introduce new invariants for Lee-metric codes via an anticode approach.
Problem

Research questions and friction points this paper is trying to address.

Lee metric
ring-linear codes
anticodes
weak compositions
lattices
Innovation

Methods, ideas, or system contributions that make the work stand out.

Lee metric
ring-linear codes
anticodes
weak compositions
lattice theory
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
J
Jessica Bariffi
Technical University of Munich, Munich, Germany
D
Drisana Bhatia
University of California Berkeley, CA, U.S.A.
Giuseppe Cotardo
Giuseppe Cotardo
Virginia Tech
Coding TheoryComplexity TheoryCombinatorics
Violetta Weger
Violetta Weger
Technical University of Munich
Applied AlgebraCryptographyNumber TheoryCoding Theory