Density of free modules over finite chain rings
From MaRDI portal
Publication:2158271
DOI10.1016/j.laa.2022.06.013OpenAlexW3172975844WikidataQ114151388 ScholiaQ114151388MaRDI QIDQ2158271
Karan Khathuria, Violetta Weger, Eimear Byrne, Anna-Lena Horlemann
Publication date: 26 July 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09403
(q)-calculus and related topics (05A30) Binomial coefficients; factorials; (q)-identities (11B65) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Theory of error-correcting codes and error-detecting codes (94Bxx) Commutative algebra (13-XX)
Related Items
On the hardness of the Lee syndrome decoding problem, Submodule codes as spherical codes in buildings, Information set decoding for Lee-metric codes using restricted balls, Bounds in the Lee metric and optimal codes, On string functions and double-sum formulas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Two-weight codes, graphs and orthogonal arrays
- Information set decoding in the Lee metric with applications to cryptography
- Gilbert-Varshamov type bounds for linear codes over finite chain rings
- Über die Identität von MacWilliams für die Gewichtsfunktion von Codes
- Lattice gas generalization of the hard hexagon model. III: \(q\)-trinomial coefficients
- Supernomial coefficients, polynomial identities and \(q\)-series
- The Andrews-Gordon identities and \(q\)-multinomial coefficients
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- On bounds for codes over Frobenius rings under homogeneous weights
- Multinomials and polynomial bosonic forms for the branching functions of the \(\widehat{su}(2)_{M}\times \widehat{su}(2)_{N}/\widehat{su}(2)_{M+N}\) conformal coset models
- Linear codes over finite chain rings
- A \(q\)-multisum identity arising from finite chain ring probabilities
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Stein's method and the rank distribution of random matrices over finite fields
- Asymptotic behaviour of codes in rank metric over finite fields
- Counting codes over rings
- Generalizations of the Rogers-Ramanujan identities
- Discrete q-Distributions
- Communication Over Finite-Chain-Ring Matrix Channels
- A Combinatorial Generalization of the Rogers-Ramanujan Identities
- Codes over integer residue rings
- Codes over Zm
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Subgroup lattices and symmetric functions
- Lee-metric BCH codes and their application to constrained and partial-response channels
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- Random codes: minimum distances and error exponents
- An Analytic Generalization of the Rogers-Ramanujan Identities for Odd Moduli
- An upper bound on the volume of discrete spheres
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Closure Solvability for Network Coding and Secret Sharing
- Limit distribution of the minimum distance of random linear codes
- Codes over certain rings
- The random coding bound is tight for the average code (Corresp.)
- Error-correcting codes: An axiomatic approach
- The asymptotic density of sequences
- Singleton bounds for codes over finite rings
