at Google ScholarTitle data
Byrne, Eimear ; Greferath, Marcus ; Kohnert, Axel ; Skachek, Vitaly:
New bounds for codes over finite Frobenius rings.
In: Designs, Codes and Cryptography.
Vol. 57
(2010)
.
- pp. 169-179.
ISSN 1573-7586
DOI: https://doi.org/10.1007/s10623-009-9359-y
Abstract in another language
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.
Further data
| Item Type: | Article in a journal |
|---|---|
| Refereed: | Yes |
| Keywords: | Codes over rings; Finite Frobenius rings; Homogeneous weights; Plotkin and Singleton bounds |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics II (Computer Algebra) Faculties Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 500 Science > 510 Mathematics |
| Date Deposited: | 21 Jan 2015 15:08 |
| Last Modified: | 01 Dec 2023 08:38 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/5787 |