Codes with forbidden distances
From MaRDI portal
Publication:1970693
DOI10.1016/S0012-365X(99)00161-2zbMath0985.94056OpenAlexW1971106100MaRDI QIDQ1970693
Gilles Zémor, L. A. Bassalygo, Gérard D. Cohen
Publication date: 19 November 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00161-2
Related Items (18)
Independence numbers of random subgraphs of a distance graph ⋮ Bounds on Distance Distributions in Codes of Given Size ⋮ 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 ⋮ On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\) ⋮ Diameters of random distance graphs ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ 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 results on two hypercube coloring problems ⋮ 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 Turán type bounds for Johnson 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
This page was built for publication: Codes with forbidden distances
