New bounds for codes over finite Frobenius rings

DOI10.1007/s10623-009-9359-yzbMath1202.94226arXiv0905.1313OpenAlexW2005612626MaRDI QIDQ2638425

Vitaly Skachek, Marcus Greferath, Axel Kohnert, Eimear Byrne

Publication date: 16 September 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.1313

zbMATH Keywords

codes over ringsfinite Frobenius ringshomogeneous weightsPlotkin and Singleton bounds

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Quasi-Frobenius rings (16L60) Bounds on codes (94B65)

Related Items (max. 100)

Two-weight codes, graphs and orthogonal arrays ⋮ Induced weights on quotient modules and an application to error correction in coherent networks ⋮ New ring-linear codes from dualization in projective Hjelmslev geometries ⋮ Lattice of ideals of the polynomial ring over a commutative chain ring ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory

Cites Work

• Unnamed Item
• Unnamed Item
• A metric for codes over residue class rings
• Applications of coding theory to the construction of modular lattices
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• On bounds for codes over Frobenius rings under homogeneous weights
• The linear programming bound for codes over finite Frobenius rings
• Kerdock code in a cyclic form
• ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS
• Duality for modules over finite rings and applications to coding theory
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Characterization of finite Frobenius rings

This page was built for publication: New bounds for codes over finite Frobenius rings