ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS

DOI10.1142/S0219498806002022zbMath1158.94418OpenAlexW2015546857MaRDI QIDQ3421572

Gary McGuire, Marcus Greferath, Michael E. O'Sullivan

Publication date: 7 February 2007

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498806002022

zbMATH Keywords

Plotkin boundFrobenius ringring-linear codesButson-Hadamard matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite rings and finite-dimensional associative algebras (16P10) Other types of codes (94B60)

Related Items (7)

New bounds for codes over finite Frobenius rings ⋮ THE SEMIPRIMENESS OF SEMIGROUP RINGS ⋮ Butson full propelinear codes ⋮ Right coideal subalgebras in \(U_q(\mathfrak{sl}_{n+1})\) ⋮ Unnamed Item ⋮ Cocyclic Hadamard matrices from forms over finite Frobenius rings ⋮ The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes

Cites Work

• Unnamed Item
• The strong Kronecker product
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• On bounds for codes over Frobenius rings under homogeneous weights
• A note on a result in the theory of code construction
• Cocyclic Simplex Codes of Type<tex>$alpha $</tex>Over<tex>$mmb Z_4$</tex>and<tex>$mmb Z_2^s$</tex>
• Duality for modules over finite rings and applications to coding theory
• Characterization of finite Frobenius rings

This page was built for publication: ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS