Codes with given distances
Let \(F\) be the field with two elements and \(C\) be a code of length \(n\) over \(F\), i.e. a subset of the \(n\)-dimensional vector space over \(F\). Let \(D(C)=\{d(x,y),\ x,y\in C,\ x\ne y\}\), where \(d(x,y)\) denotes the Hamming distance between \(x\) and \(y\). This paper concerns several problems about codes for which \(D(C)\) does not contain some prescribed values. One of the main results says that if \(C\) is linear of length \(4t\) and dimension at least \(2t\), then \(2t-1\) or \(2t\) belongs to \(D(C)\). Using this result the authors give a short proof for Gleason's theorem; if \(C\) is a linear code of length \(n\) which is self-dual and \(4\mid d\) for every \(d\in D(C)\), then \(8\mid n\). Another consequence of the main result is that if \(F_1,\ldots, F_{2t-1}\) are subsets of \(X\), \(| X| =4t\), then there exists a \(G\le X\) of size \(2t\) such that \(| G\cap F_i|\) is even for all \(i\), \(1\le i\le 2t-1\). For the proof of the main results a lemma introducing the binormal forms of binary matrices is needed.
- Weight distributions of linear codes and the Gleason-Pierce theorem
- On designs and formally self-dual codes
- On self-dual doubly-even extremal codes
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
- A combinatorial problem on finite Abelian groups. I
- Balancing sets of vectors
- Divisible codes
- Forbidden Intersections
- Forbidding just one intersection
- Four fundamental parameters of a code and their combinatorial significance
- Hadamard graphs. I
- Hadamard graphs. II
- scientific article; zbMATH DE number 3756373 (Why is no real title available?)
- On a combinatorial conjecture of Erdös
- On the ratio of optimal integral and fractional covers
- Orthogonal vectors in the n-dimensional cube and codes with missing distances
- The Erdös-Ko-Rado Theorem for Integer Sequences
- The exact bound in the Erdős-Ko-Rado theorem
- The realization of distances within sets in Euclidean space
- Two combinatorial covering theorems
- Weight enumerators of self-orthogonal codes
- Maximum weight spectrum codes
- How many weights can a linear code have?
- Zero-sum square matrices
- \(L\)-balancing families
- 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
- \(d\)-Galvin families
- New results on two hypercube coloring problems
- Constructions of binary codes with two distances
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
- Forbidden Intersections
- Maximum distance of anticodes
- On splitting and splittable families
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- A note on full weight spectrum codes
- A robust version of Hegedűs's lemma, with applications
- Codes with a disparity property
- Odd-Ramsey numbers of complete bipartite graphs
- Sphere packings in Euclidean space with forbidden distances
- The Erdős-Ginzberg-Ziv theorem with units
This page was built for publication: Codes with given distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094390)