Pages that link to "Item:Q4135374"
From MaRDI portal
The following pages link to New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities (Q4135374):
Displaying 50 items.
- On the BSC reliability function: expanding the region where it is known exactly (Q327296) (← links)
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- Sphere packing bounds via spherical codes (Q398996) (← links)
- Spectral approach to linear programming bounds on codes (Q415647) (← links)
- Code spectrum and the reliability function: binary symmetric channel (Q415682) (← links)
- Difference sets and positive exponential sums. I: General properties (Q485211) (← links)
- On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
- Zeros of generalized Krawtchouk polynomials (Q584473) (← links)
- An application of coding theory to estimating Davenport constants (Q634137) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- On gaps between quadratic non-residues in the Euclidean and Hamming metrics (Q740468) (← links)
- New upper bounds in the hypothesis testing problem with information constraints (Q784381) (← links)
- Minimal 2-coverings of a finite affine space based on GF(2) (Q787145) (← links)
- Odd and even Hamming spheres also have minimum boundary (Q798656) (← links)
- Linear binary codes with intersection properties (Q800294) (← links)
- On the high density behavior of Hamming codes with fixed minimum distance (Q852065) (← links)
- A new upper bound on nonbinary block codes (Q920930) (← links)
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- Dense packings from quadratic fields and codes (Q941315) (← links)
- Linear programming bounds for codes via a covering argument (Q1017926) (← links)
- Commutative association schemes (Q1039424) (← links)
- On character sums and codes (Q1075358) (← links)
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound (Q1167704) (← links)
- Diameter, covering index, covering radius and eigenvalues (Q1174153) (← links)
- Local randomness in pseudorandom sequences (Q1180515) (← links)
- An optimal polynomial for a covering radius problem (Q1199501) (← links)
- On the cardinality of sets of sequences with given maximum correlation (Q1199639) (← links)
- Designs as maximum codes in polynomial metric spaces (Q1201908) (← links)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (Q1292857) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- On the covering radius of an unrestricted code as a function of the rate and dual distance (Q1383375) (← links)
- Constrained energy problems with applications to orthogonal polynomials of a discrete variable (Q1385428) (← links)
- Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001 (Q1409591) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
- Torus actions on manifolds of positive sectional curvature. (Q1886155) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- On lower bounds on the spectrum of a binary code (Q2190925) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- Weight enumerators for nonbinary asymmetric quantum codes and their applications (Q2221760) (← links)
- Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
- Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube (Q2326494) (← links)
- The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798) (← links)
- Sharpening of an upper bound for the reliability function of a binary symmetric channel (Q2432956) (← links)
- Note on the size of binary Armstrong codes (Q2439741) (← links)
- High-dimensional sphere packing and the modular bootstrap (Q2660222) (← links)
