Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
From MaRDI portal
Publication:2278701
DOI10.1134/S0032946018040026zbMath1471.94026arXiv1801.01982OpenAlexW2964264560MaRDI QIDQ2278701
Danyo Danev, M. M. Stoyanova, P. G. Boyvalenkov
Publication date: 10 December 2019
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01982
Applications of mathematical programming (90C90) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral approach to linear programming bounds on codes
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Designs as maximum codes in polynomial metric spaces
- On linear programming bounds for codes in polynomial metric spaces
- Linear spaces of quadrics and new good codes
- Orthogonal arrays. Theory and applications
- Linear programming bounds for codes of small size
- On integral zeros of Krawtchouk polynomials
- Semidefinite bounds for nonbinary codes based on quadruples
- A class of low-rate nonlinear binary codes
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Bounds for binary codes just outside the plotkin range
- Bounds for binary codes of length less than 25
- A table of upper bounds for binary codes
- Association schemes and coding theory
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- On the optimum of Delsarte's linear program
This page was built for publication: Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
