Density of Free Modules over Finite Chain Rings

DOI10.1016/J.LAA.2022.06.013arXiv2106.09403WikidataQ114151388 ScholiaQ114151388MaRDI QIDQ6370546FDOQ6370546

Authors: Eimear Byrne, Anna-Lena Horlemann, Karan Khathuria, Violetta Weger 

Publication date: 17 June 2021

Abstract: In this paper we focus on modules over a finite chain ring $mathcalR$ of size $q^s$. We compute the density of free modules of $mathcal{R}^n$, where we separately treat the asymptotics in $n,q$ and $s$. In particular, we focus on two cases: one where we fix the length of the module and one where we fix the rank of the module. In both cases, the density results can be bounded by the Andrews-Gordon identities. We also study the asymptotic behaviour of modules generated by random matrices over $mathcalR$. Since linear codes over $mathcalR$ are submodules of $mathcal{R}^n$ we get direct implications for coding theory. For example, we show that random codes achieve the Gilbert-Varshamov bound with high probability.

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) (q)-calculus and related topics (05A30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Structure of finite commutative rings (13M05) Linear codes (general theory) (94B05) Binomial coefficients; factorials; (q)-identities (11B65)

This page was built for publication: Density of Free Modules over Finite Chain Rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370546)