New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
From MaRDI portal
Publication:4135374
DOI10.1109/TIT.1977.1055688zbMath0361.94016WikidataQ63854909 ScholiaQ63854909MaRDI QIDQ4135374
Howard jun. Rumsey, Eugène Rodemich, Lloyd R. Welch, Robert J. McEliece
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (72)
Capacities: From information theory to extremal set theory ⋮ Torus actions on manifolds of positive sectional curvature. ⋮ The complexity of error-correcting codes ⋮ On the extremal combinatorics of the Hamming space ⋮ Estimates of the distance distribution of codes and designs ⋮ Linear Batch Codes ⋮ On the high density behavior of Hamming codes with fixed minimum distance ⋮ On the BSC reliability function: expanding the region where it is known exactly ⋮ An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ Semidefinite programming in combinatorial optimization ⋮ High-dimensional sphere packing and the modular bootstrap ⋮ Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ Constrained energy problems with applications to orthogonal polynomials of a discrete variable ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ A new upper bound for the minimum of an integral lattice of determinant 1 ⋮ On the VC-Dimension of Binary Codes ⋮ Sphere packing bounds via spherical codes ⋮ One more proof of the first linear programming bound for binary codes and two conjectures ⋮ Near-sunflowers and focal families ⋮ On the lower bound for the length of minimal codes ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On lower bounds on the spectrum of a binary code ⋮ Spectral approach to linear programming bounds on codes ⋮ Code spectrum and the reliability function: binary symmetric channel ⋮ Averaging over codes and an SU(2) modular bootstrap ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Expander graphs and their applications ⋮ Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001 ⋮ An application of coding theory to estimating Davenport constants ⋮ Sharpening of an upper bound for the reliability function of a binary symmetric channel ⋮ Multiplicative complexity of vector valued Boolean functions ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ Note on the size of binary Armstrong codes ⋮ Unnamed Item ⋮ Hypercontractivity of Spherical Averages in Hamming Space ⋮ A new upper bound on nonbinary block codes ⋮ Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Weight enumerators for nonbinary asymmetric quantum codes and their applications ⋮ Diameter, covering index, covering radius and eigenvalues ⋮ On the minimum average distance of binary constant weight codes ⋮ Local randomness in pseudorandom sequences ⋮ Difference sets and positive exponential sums. I: General properties ⋮ Dense packings from quadratic fields and codes ⋮ On metric properties of maps between Hamming spaces and related graph homomorphisms ⋮ An optimal polynomial for a covering radius problem ⋮ On the cardinality of sets of sequences with given maximum correlation ⋮ Designs as maximum codes in polynomial metric spaces ⋮ Algebraic complexities and algebraic curves over finite fields ⋮ What is known about unit cubes ⋮ Sharpening the Gilbert-Varshamov bound in the finite case ⋮ Binary \(B_2\)-sequences: a new upper bound ⋮ Covering and radius-covering arrays: constructions and classification ⋮ On the optimum of Delsarte's linear program ⋮ Zeros of generalized Krawtchouk polynomials ⋮ Arthur ErdÉlyi ⋮ On gaps between quadratic non-residues in the Euclidean and Hamming metrics ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Linear programming bounds for codes via a covering argument ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Commutative association schemes ⋮ Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube ⋮ Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications ⋮ New upper bounds in the hypothesis testing problem with information constraints ⋮ Universally optimal distribution of points on spheres ⋮ Minimal 2-coverings of a finite affine space based on GF(2) ⋮ Capacities of Quantum Erasure Channels ⋮ Odd and even Hamming spheres also have minimum boundary ⋮ Linear binary codes with intersection properties ⋮ The density of sets avoiding distance 1 in Euclidean space ⋮ On character sums and codes
This page was built for publication: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
