Refinements of Levenshtein bounds in q-ary Hamming spaces

DOI10.1134/S0032946018040026MaRDI QIDQ2278701zbMATH OpenOpenAlexFDO

Authors Danyo Danev, Peter Boyvalenkov, M. M. Stoyanova

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

zbMATH Keywords

asymptotic boundsLevenshtein boundgeneral LP bound

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: We develop refinements of the Levenshtein bound in $q$-ary Hamming spaces by taking into account the discrete nature of the distances versus the continuous behavior of certain parameters used by Levenshtein. The first relevant cases are investigated in detail and new bounds are presented. In particular, we derive generalizations and $q$-ary analogs of a MacEliece bound. We provide evidence that our approach is as good as the complete linear programming and discuss how faster are our calculations. Finally, we present a table with parameters of codes which, if exist, would attain our bounds.

Recommendations

• New upper bounds on Lee codes
• Some new bounds for q-ary linear block codes
• Improving the Gilbert-Varshamov bound for \(q\)-ary codes
• Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes
• Some remarks on the Plotkin bound

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• scientific article; zbMATH DE number 2061016 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3382186 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• scientific article; zbMATH DE number 3037624 (Why is no real title available?)
• A class of low-rate nonlinear binary codes
• A table of upper bounds for binary codes
• Association schemes and coding theory
• Bounds for binary codes just outside the plotkin range
• Bounds for binary codes of length less than 25
• Designs as maximum codes in polynomial metric spaces
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• Linear programming bounds for codes of small size
• Linear spaces of quadrics and new good codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Numerical results on the asymptotic rate of binary codes
• On integral zeros of Krawtchouk polynomials
• On linear programming bounds for codes in polynomial metric spaces
• On the optimum of Delsarte's linear program
• Orthogonal arrays. Theory and applications
• Semidefinite bounds for nonbinary codes based on quadruples
• Spectral approach to linear programming bounds on codes

Cited in

(2)

• High-dimensional sphere packing and the modular bootstrap
• On Rosenbloom and Tsfasman's generalization of the Hamming space

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278701)