Density of free modules over finite chain rings

(q)-calculus and related topics (05A30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Binomial coefficients; factorials; (q)-identities (11B65) Theory of error-correcting codes and error-detecting codes (94Bxx) Commutative algebra (13-XX)

Cites Work

A Mathematical Theory of Communication
Title not available (Why is that?)
Finite-ring combinatorics and MacWilliams' equivalence theorem
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
An Analytic Generalization of the Rogers-Ramanujan Identities for Odd Moduli
Title not available (Why is that?)
Title not available (Why is that?)
Two-weight codes, graphs and orthogonal arrays
A Combinatorial Generalization of the Rogers-Ramanujan Identities
Codes over integer residue rings
Codes over certain rings
Subgroup lattices and symmetric functions
Über die Identität von MacWilliams für die Gewichtsfunktion von Codes
Lattice gas generalization of the hard hexagon model. III: \(q\)-trinomial coefficients
Linear codes over finite chain rings
Title not available (Why is that?)
On bounds for codes over Frobenius rings under homogeneous weights
Error-correcting codes: An axiomatic approach
The asymptotic density of sequences
Random codes: minimum distances and error exponents
Singleton bounds for codes over finite rings
Discrete \(q\)-distributions
Asymptotic behaviour of codes in rank metric over finite fields
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
Codes over Zm
Lee-metric BCH codes and their application to constrained and partial-response channels
Information set decoding in the Lee metric with applications to cryptography
Supernomial coefficients, polynomial identities and \(q\)-series
Gilbert-Varshamov type bounds for linear codes over finite chain rings
Stein's method and the rank distribution of random matrices over finite fields
The Andrews-Gordon identities and \(q\)-multinomial coefficients
Generalizations of the Rogers-Ramanujan identities
Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
Limit distribution of the minimum distance of random linear codes
Title not available (Why is that?)
An upper bound on the volume of discrete spheres
Counting codes over rings
Title not available (Why is that?)
Partition-balanced families of codes and asymptotic enumeration in coding theory
Common Complements of Linear Subspaces and the Sparseness of MRD Codes
A \(q\)-multisum identity arising from finite chain ring probabilities
Title not available (Why is that?)
Communication Over Finite-Chain-Ring Matrix Channels
Closure Solvability for Network Coding and Secret Sharing
The random coding bound is tight for the average code (Corresp.)

Cited In (9)

Bounds in the Lee metric and optimal codes
Density of Free Modules over Finite Chain Rings
On counting subring-submodules of free modules over finite commutative Frobenius rings
On the hardness of the Lee syndrome decoding problem
Information set decoding for Lee-metric codes using restricted balls
On chains of free modules over valuation domains
Submodule codes as spherical codes in buildings
On string functions and double-sum formulas
\textsf{FuLeeca}: a Lee-based signature scheme

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 Q2158271)