Counting codes over rings

DOI10.1007/S10623-013-9815-6zbMath1355.94090OpenAlexW2055116233MaRDI QIDQ2510659

Esengül Saltürk, Steven T. Dougherty

Publication date: 1 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10623-013-9815-6

zbMATH Keywords

linear codesfinite chain ringsfinite principal ideal ringsfree codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (5)

Density of free modules over finite chain rings ⋮ On counting subring-submodules of free modules over finite commutative Frobenius rings ⋮ The number of codes over rings of order 4 containing a hull of given type ⋮ Enumeration of some matrices and free linear codes over commutative finite local rings ⋮ Generalized symplectic graphs and generalized orthogonal graphs over finite commutative rings

Cites Work

• Unnamed Item
• Unnamed Item
• Higher weights for codes over rings
• MDS codes over finite principal ideal rings
• Modular independence and generator matrices for codes over \(\mathbb{Z}_m\)
• Independence of vectors in codes over rings
• HIGHER WEIGHTS AND GENERALIZED MDS CODES
• Duality for modules over finite rings and applications to coding theory
• OPTIMAL LINEAR CODES OVER ℤ_m

This page was built for publication: Counting codes over rings