Gilbert-Varshamov type bounds for linear codes over finite chain rings
From MaRDI portal
Publication:874420
DOI10.3934/amc.2007.1.99zbMath1113.94012OpenAlexW2020044431MaRDI QIDQ874420
Publication date: 5 April 2007
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2007.1.99
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite rings and finite-dimensional associative algebras (16P10) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Related Items (3)
Density of free modules over finite chain rings ⋮ Constructing self-dual codes over \(\mathbb{F}_q[u/(u^t)\)] ⋮ Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes
This page was built for publication: Gilbert-Varshamov type bounds for linear codes over finite chain rings
