Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
type: Item
instance of: scholarly article
title: Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
zbMATH Open document ID: 1471.94026
DOI: 10.1134/S0032946018040026
author: Danyo Danev
author: Peter Boyvalenkov
author: M. M. Stoyanova
published in: Problems of Information Transmission
publication date: 2019-12-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/1801.01982
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7141753
zbMATH Keywords: general LP bound
zbMATH Keywords: Levenshtein bound
zbMATH Keywords: asymptotic bounds
describes a project that uses: SageMath
MaRDI profile type: Publication
arXiv ID: 1801.01982
cites work: Association schemes and coding theory
cites work: Designs as maximum codes in polynomial metric spaces
cites work: Q4242013
cites work: Q5707657
cites work: Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
cites work: Q4146667
cites work: Bounds for binary codes just outside the plotkin range
cites work: Linear programming bounds for codes of small size
cites work: Q5652531
cites work: Q5777281
cites work: Spectral approach to linear programming bounds on codes
cites work: On linear programming bounds for codes in polynomial metric spaces
cites work: On integral zeros of Krawtchouk polynomials
cites work: Q4456868
cites work: Numerical results on the asymptotic rate of binary codes
cites work: On the optimum of Delsarte's linear program
cites work: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
cites work: Semidefinite bounds for nonbinary codes based on quadruples
cites work: Linear spaces of quadrics and new good codes
cites work: Q4821526
cites work: A class of low-rate nonlinear binary codes
cites work: A table of upper bounds for binary codes
cites work: Bounds for binary codes of length less than 25
cites work: Orthogonal arrays. Theory and applications
OpenAlex ID: W2964264560
description: scientific article