Split Orthogonal Arrays and Maximum Independent ResilientSystems of Functions
Designs, Codes and Cryptography
Bounds on Spectra of Codes with Known Dual Distance
Designs, Codes and Cryptography
Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces
Proceedings of the 8th IMA International Conference on Cryptography and Coding
| Hi-index | 754.84 |
Universal bounds for the cardinality of codes in the Hamming space Frn with a given minimum distance d and/or dual distance d' are stated. A self-contained proof of optimality of these bounds in the framework of the linear programming method is given. The necessary and sufficient conditions for attainability of the bounds are found. The parameters of codes satisfying these conditions are presented in a table. A new upper bound for the minimum distance of self-dual codes and a new lower bound for the crosscorrelation of half-linear codes are obtained