On counting subring-submodules of free modules over finite commutative Frobenius rings
Structure, classification theorems for modules and ideals in commutative rings (13C05) Structure of finite commutative rings (13M05) Artinian rings and modules (associative rings and algebras) (16P20) Chain conditions on other classes of submodules, ideals, subrings, etc.; coherence (associative rings and algebras) (16P70) Linear codes (general theory) (94B05) Combinatorial codes (94B25)
Let \(R\) be a finite Frobenius commutative ring and \(S\) a finite Galois extension ring of \(R\) of degree \(m\). For each free \(S\)-submodule \(B\) of the free module \(S^{\ell}\) let \(B'=B\cap R^{\ell}\) be the corresponding \(R\)-submodule of \(R^{\ell}\). For positive integers \(k,k'\), the main result of the paper under review is a formula for the number of free \(S\)-submodules \(B\) of the free module \(S^{\ell}\) such that \(S\)-rank of \(B\) is \(k\) and the \(R\)-rank of \(B'\) is \(k'\). The formula is obtained first in the case when \(R\) is a local ring (Theorem 4) and then in the general case (Theorem 6) by decomposing \(R\) as a finite direct product of local Frobenius rings given by the quotiens of \(R\) by adequate powers of the maximal ideals of \(R\). For \({\mathbb F}_q\) a finite field and \({\mathbb F}_{q^m}\) a finite extension of degree \(m\), a by-product of the main result of the paper is a correct formula for the number of distinct \({\mathbb F}_{q^m}\) -linear codes of length \(\ell\), dimension \(k\), and a common fixed subcode over \({\mathbb F}_q\). As the authors point out, this corrects a wrong formula in Theorem 6 of [\textit{B. Lyle}, Linear Algebra Appl. 22, 223--233 (1978; Zbl 0411.15010)].
- Counting codes over rings
- On finite rings over which all free codes are splitting
- On the weight distribution of codes over finite rings
- Computation of minimum Hamming weight for linear codes
- Density of free modules over finite chain rings
- Decoding of linear codes over Galois rings
- scientific article; zbMATH DE number 1932956
- On the Hamming distance of linear codes over a finite chain ring
- On trace codes and Galois invariance over finite commutative chain rings
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- A linear-algebra problem from algebraic coding theory
- Counting codes over rings
- Higher weights for codes over rings
- scientific article; zbMATH DE number 3836845 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- Independence of vectors in codes over rings
- MDS codes over finite principal ideal rings
- On separable algebras over a commutative ring
- On the intersection of two subgeometries of \(PG(n,q)\)
- On trace codes and Galois invariance over finite commutative chain rings
- Separable algebras over commutative rings
- The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
- On freely generated \(E\)-subrings
- Enumeration of some matrices and free linear codes over commutative finite local rings
- Density of free modules over finite chain rings
- On the expected number of generators of a submodule of a free module over a finite principal ideal ring
- Counting codes over rings
- On the expected number of generators of a submodule of a free module over a finite special principal ideal ring
- Saturation of finitely-generated submodules of free modules over Prüfer domains
- MacWilliams duality for rank metric codes over finite chain rings
This page was built for publication: On counting subring-submodules of free modules over finite commutative Frobenius rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671637)
