Spectral approach to linear programming bounds on codes
From MaRDI portal
Publication:415647
DOI10.1134/S0032946006020025zbMATH Open1237.94147arXivcs/0512024OpenAlexW2953009186MaRDI QIDQ415647FDOQ415647
Authors: Alexander Barg, Dmitrii Yu. Nogin 
Publication date: 9 May 2012
Published in: Problems of Information Transmission (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cs/0512024
Recommendations
Cites Work
- Title not available (Why is that?)
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Bound on the Extreme Zeros of Orthogonal Polynomials
- Title not available (Why is that?)
- Linear programming bounds for codes in grassmannian spaces
- Title not available (Why is that?)
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
Cited In (11)
- Title not available (Why is that?)
- Linear programming bounds for unitary codes
- Some spectral techniques in coding theory
- Bounds for codes by semidefinite programming
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Linear programming-based optimization of the distance spectrum of linear block codes
- On the optimum of Delsarte's linear program
- Asymptotically exact uniform bounds for spectra of cosets of linear codes
- Linear programming bounds for codes via a covering argument
- Title not available (Why is that?)
- A Functional View of Upper Bounds on 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)
