Cubic and higher degree bounds for codes and (t, m, s)-nets |
| |
| Authors: | Horst Trinker |
| |
| Affiliation: | (1) Mathematics Department, US Naval Academy, Chauvenet Hall Holloway Road 572C, Annapolis, Maryland 21402, USA;(2) Department of Mathematics, University of Louisville, Natural Sciences Building 328, Louisville, KY 40292, USA |
| |
| Abstract: | ![]()
The Plotkin bound and the quadratic bound for codes and (t, m, s)-nets can be obtained from the linear programming bound using certain linear and quadratic polynomials, respectively. We extend this approach by considering cubic and higher degree polynomials to find new explicit bounds as well as new non-existence results for codes and (t, m, s)-nets. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
