New bounds for codes over finite Frobenius rings |
| |
| Authors: | Eimear Byrne Marcus Greferath Axel Kohnert Vitaly Skachek |
| |
| Institution: | 1.School of Mathematical Sciences,University College Dublin,Belfield, Dublin 4,Ireland;2.Department of Mathematics,University of Bayreuth,Bayreuth,Germany;3.Nanyang Technological University,Singapore,Singapore |
| |
| Abstract: | We give further 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 (Greferath and O’Sullivan, Discr Math
289:11–24, 2004) and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
