Spectral approach to linear programming bounds on codes
From MaRDI portal
Abstract: We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
Recommendations
Cites work
- scientific article; zbMATH DE number 1588324 (Why is no real title available?)
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Bound on the Extreme Zeros of Orthogonal Polynomials
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Linear programming bounds for codes in grassmannian spaces
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
Cited in
(13)- On the optimum of Delsarte's linear program
- Some spectral techniques in coding theory
- A new proof of a generalization of Gerzon's bound
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- scientific article; zbMATH DE number 1123782 (Why is no real title available?)
- Asymptotically exact uniform bounds for spectra of cosets of linear codes
- scientific article; zbMATH DE number 1559531 (Why is no real title available?)
- Linear programming bounds for codes via a covering argument
- A Functional View of Upper Bounds on Codes
- Bounds for codes by semidefinite programming
- On spectra of linear codes
- Linear programming-based optimization of the distance spectrum of linear block codes
- Linear programming bounds for unitary codes
This page was built for publication: Spectral approach to linear programming bounds on codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415647)
