scientific article
From MaRDI portal
Publication:2717206
zbMath0981.33003MaRDI QIDQ2717206
Ilia Krasikov, Simon N. Litsyn
Publication date: 13 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
symmetryupper boundzerosrecurrenceasymptoticHamming association schemesinteger rootsbinary Krawtchouk polynomialsJFM 55.0799.01
Related Items (8)
One more proof of the first linear programming bound for binary codes and two conjectures ⋮ Harmonic index designs in binary Hamming schemes ⋮ Hypercontractivity of Spherical Averages in Hamming Space ⋮ On metric properties of maps between Hamming spaces and related graph homomorphisms ⋮ Asymptotic analysis of the Krawtchouk polynomials by the WKB method ⋮ Integer zeros of \(q\)-Krawtchouk polynomials in classical combinatorics ⋮ Lower bounds on the minimum average distance of binary codes ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound
This page was built for publication:
