Codes with forbidden distances
From MaRDI portal
The maximum cardinality of binary linear and nonlinear block codes is estimated when arbitrary restrictions are imposed on the set of distances between codewords.
Cited in
(23)- Diameters of random distance graphs
- New Turán type bounds for Johnson graphs
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
- On a Frankl-Wilson theorem
- Estimate of the number of edges in special subgraphs of a distance graph
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On threshold probability for the stability of independent sets in distance graphs
- The number of edges in induced subgraphs of some distance graphs
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- New results on two hypercube coloring problems
- Independence numbers of random subgraphs of a distance graph
- On the number of edges in induced subgraphs of a special distance graph
- Independence numbers of random subgraphs of distance graphs
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Bounds on distance distributions in codes of given size
- Maximum distance of anticodes
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Codes with a disparity property
- Odd-Ramsey numbers of complete bipartite graphs
- Sphere packings in Euclidean space with forbidden distances
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
This page was built for publication: Codes with forbidden distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970693)
