|
|||||
|
|
The linear programming bound for codes over finite Frobenius rings |
|
| Authors: | Eimear Byrne Marcus Greferath Michael E. O’Sullivan |
| Affiliation: | (1) School of Mathematical Sciences, University College Dublin, Belfield, Dublin 4, Ireland;(2) Department of Mathematics and Statistics, San Diego State University, 5500 Campanile Drive, San Diego, CA 92182-7720, USA |
| Abstract: | In traditional algebraic coding theory the linear-programming bound is one of the most powerful and restrictive bounds for the existence of both linear and non-linear codes. This article develops a linear-programming bound for block codes on finite Frobenius rings. An erratum to this article can be found at |
| Keywords: | Codes over rings Finite Frobenius rings Homogeneous weights Linear-programming bound |
| 本文献已被 SpringerLink 等数据库收录！ | |