New Bounds for Codes Over Finite Frobenius Rings

Simple item page
dc.creatorByrne, Eimear
dc.creatorGreferath, Marcus
dc.creatorKohnert, Axel
dc.creatorSkachek, Vitaly
dc.date2009-05-08
dc.date.accessioned2026-07-07T13:13:08Z
dc.date.available2026-07-07T13:13:08Z
dc.descriptionWe give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds.
dc.identifierhttps://arxiv.org/abs/0905.1313
dc.identifierhttp://arxiv.org/abs/0905.1313
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229790
dc.subjectCombinatorics
dc.titleNew Bounds for Codes Over Finite Frobenius Rings
dc.typetext

Files

Collections

arXiv