An Algebraic Invariant for Free Convolutional Codes over Finite Local Rings
Mohammed El Oued

TL;DR
This paper introduces the Residual Structural Polynomial as a new algebraic invariant for free convolutional codes over finite local rings, providing criteria for non-catastrophic realizations and revealing duality properties.
Contribution
It defines a novel invariant, Delta_p(C), that characterizes free convolutional codes over Z_{p^r} and links it to code catastrophicity and duality.
Findings
Delta_p(C) is an intrinsic code invariant.
Non-catastrophic codes correspond to monomial Delta_p(C).
Delta_p(C) equals Delta_p(C^perp), showing duality symmetry.
Abstract
This paper investigates the algebraic structure of free convolutional codes over the finite local ring Z_{p^r}. We introduce a new structural invariant, the Residual Structural Polynomial, denoted by Delta_p(C) in F_p[D]. We construct this invariant via encoders which are reduced internal degree matrices (RIDM). We formally demonstrate that Delta_p(C) is an intrinsic characteristic of the code, invariant under equivalent RIDMs. A central result of this work is the establishment that Delta_p(C) serves as an algebraic criterion for intrinsic catastrophicity: we prove that a free code C admits a non-catastrophic realization if and only if Delta_p(C) is a monomial of the form D^s. Furthermore, we establish a fundamental duality theorem, proving that Delta_p(C) = Delta_p(C^perp). This result reveals a deep structural symmetry, showing that the "catastrophicity" of a free code is preserved…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Rings, Modules, and Algebras · Polynomial and algebraic computation
