On Counting Subring-Subcodes of Free Linear Codes Over Finite Principal Ideal Rings

Abstract

Let R be a finite principal ideal ring and S the Galois extension of R of degree m. For k and k0, positive integers we determine the number of free S-linear codes B of length l with the property k = rankS(B) and k0 = rankR (B Rl). This corrects a wrong result which was given in the case of finite fields.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…