The following pages link to Codes with given distances (Q1094390):
Displaying 21 items.
- Codes with a disparity property (Q679237) (← links)
- The Erdős-Ginzberg-Ziv theorem with units (Q998426) (← links)
- Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}]\) (Q1361703) (← links)
- Maximum weight spectrum codes (Q1726015) (← links)
- How many weights can a linear code have? (Q1755995) (← links)
- Zero-sum square matrices (Q1864564) (← links)
- \(L\)-balancing families (Q2116371) (← links)
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\) (Q2174953) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- \(d\)-Galvin families (Q2294104) (← links)
- New results on two hypercube coloring problems (Q2446885) (← links)
- Constructions of binary codes with two distances (Q2699909) (← links)
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs (Q3599145) (← links)
- Forbidden Intersections (Q3751579) (← links)
- Maximum distance of anticodes (Q3985186) (← links)
- On splitting and splittable families (Q5080923) (← links)
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899) (← links)
- A note on full weight spectrum codes (Q5135734) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
