Codes with given distances
From MaRDI portal
Publication:1094390
DOI10.1007/BF01788526zbMath0629.94014OpenAlexW1973652235MaRDI QIDQ1094390
Publication date: 1987
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788526
Linear codes (general theory) (94B05) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)
Related Items (16)
On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\) ⋮ System of unbiased representatives for a collection of bicolorings ⋮ Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ New results on two hypercube coloring problems ⋮ Maximum weight spectrum codes ⋮ On splitting and splittable families ⋮ How many weights can a linear code have? ⋮ Lower Bounds for Syntactically Multilinear Algebraic Branching Programs ⋮ Forbidden Intersections ⋮ A note on full weight spectrum codes ⋮ The Erdős-Ginzberg-Ziv theorem with units ⋮ \(d\)-Galvin families ⋮ Unnamed Item ⋮ Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits ⋮ Zero-sum square matrices ⋮ \(L\)-balancing families
Cites Work
- Unnamed Item
- The exact bound in the Erdős-Ko-Rado theorem
- Forbidding just one intersection
- Hadamard graphs. I
- Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
- Hadamard graphs. II
- Divisible codes
- Weight enumerators of self-orthogonal codes
- On the ratio of optimal integral and fractional covers
- Two combinatorial covering theorems
- A combinatorial problem on finite Abelian groups. I
- Forbidden Intersections
- The Erdös-Ko-Rado Theorem for Integer Sequences
- Four fundamental parameters of a code and their combinatorial significance
- On a combinatorial conjecture of Erdös
- The realization of distances within sets in Euclidean space
- Balancing sets of vectors
This page was built for publication: Codes with given distances
