Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
From MaRDI portal
Publication:4859756
Recommendations
Cited in
(55)- Linear transformations of monotone functions on the discrete cube
- Degree conditions for vertex switching reconstruction
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Zero distributions for discrete orthogonal polynomials
- Constrained energy problems with applications to orthogonal polynomials of a discrete variable
- A uniform asymptotic expansion for Krawtchouk polynomials
- Self-dual codes better than the Gilbert-Varshamov bound
- On bounds for codes over Frobenius rings under homogeneous weights
- Minimal linear codes over finite fields
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
- Asymptotic expansion of the Krawtchouk polynomials and their zeros
- Edge-isoperimetric inequalities and ball-noise stability: linear programming and probabilistic approaches
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- On distance distributions of orthogonal arrays
- Weight enumerators for nonbinary asymmetric quantum codes and their applications
- Kravchuk polynomials and induced/reduced operators on Clifford algebras
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Mehler-Heine type formulas for the Krawtchouk polynomials
- Energy bounds for codes in polynomial metric spaces
- Quasi-random multilinear polynomials
- Global asymptotics of Krawtchouk polynomials -- a Riemann-Hilbert approach
- On two-weight codes
- Dimension-free L2 maximal inequality for spherical means in the hypercube
- Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays
- scientific article; zbMATH DE number 4135866 (Why is no real title available?)
- Bounds on ordered codes and orthogonal arrays
- Spectral approach to linear programming bounds on codes
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- \Delta -Coherent Pairs and Orthogonal Polynomials of a Discrete Variable
- Dimension-free L^p-maximal inequalities for spherical means in the hypercube
- Generalized Krawtchouk polynomials and the complete weight enumerator of the dual code
- Generalizing Krawtchouk polynomials using Hadamard matrices
- scientific article; zbMATH DE number 7360437 (Why is no real title available?)
- Energy bounds for codes and designs in Hamming spaces
- Nonexistence of a few binary orthogonal arrays
- Krawtchouk matrices, Feynman path integral and the split quaternions
- Kravchuk matrices and induced operators on Clifford algebras
- Edge-Isoperimetric Inequalities and Influences
- Constrained Leja points and the numerical solution of the constrained energy problem
- On the optimum of Delsarte's linear program
- The single-indexed exceptional Krawtchouk polynomials
- Infinite families of minimal binary codes via Krawtchouk polynomials
- Dimension-free estimates on \(l^2 (\mathbb{Z}^d)\) for a discrete dyadic maximal function over \(l^1\) balls: small scales
- Numerical computations of time-dependent auto-catalytic glycolysis chemical reaction-diffusion system
- Discrete quantum harmonic oscillator and Kravchuk transform
- Remark on dimension-free estimates for discrete maximal functions over ^q balls: small dyadic scales
- Pseudorandomness, symmetry, smoothing: I
- Improving the Gilbert-Varshamov bound by graph spectral method
- Worst and average case hardness of decoding via smoothing bounds
- On the fine-grained query complexity of symmetric functions
- On the fine-grained query complexity of symmetric functions
- MacWilliams identities for additive codes with poset-block metric over Galois rings
- Dimension-free estimates for discrete maximal functions and lattice points in high-dimensional spheres and balls with small radii
- New bounds on the covering radius of orthogonal arrays of even strength
- Asymptotic analysis of the Krawtchouk polynomials by the WKB method
This page was built for publication: Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859756)
