New Bounds for Codes Over Finite Frobenius Rings
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
We 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.