Gilbert-Varshamov type bounds for linear codes over finite chain rings

DOI10.3934/AMC.2007.1.99zbMATH Open1113.94012OpenAlexW2020044431MaRDI QIDQ874420FDOQ874420

Ferruh Özbudak, Patrick Solé

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

Recommendations

• A Griesmer bound for codes over finite quasi-Frobenius rings
• scientific article; zbMATH DE number 774615
• scientific article
• A Griesmer bound for linear codes over finite quasi-Frobenius rings
• On bounds for codes over Frobenius rings under homogeneous weights

zbMATH Keywords

Gilbert-Varshamov boundlinear codesasymptotic boundsfinite chain rings

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65) Finite rings and finite-dimensional associative algebras (16P10)

Cited In (7)

• Homogeneous bounds for the image of linear block codes over Galois ring extensions
• On the Hamming distance of linear codes over a finite chain ring
• Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes
• The linear programming bound for codes over finite Frobenius rings
• Constructing self-dual codes over \(\mathbb{F}_q[u]/(u^t)\)
• Title not available (Why is that?)
• Density of free modules over finite chain rings

This page was built for publication: Gilbert-Varshamov type bounds for linear codes over finite chain rings

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