Balancing sets of vectors

DOI10.1109/18.2610zbMath0647.94018MaRDI QIDQ5903678

E. E. Bergmann, Noga Alon, Andrew M. Odlyzko, Don Coppersmith

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/08ffadd0749281bf8ffbabfd44e5950b238b9b52

zbMATH Keywords

Hadamard matrix; construction of signal sets for optical data links

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

Related Items

Unnamed Item, On splitting and splittable families, Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits, On identifying codes in binary Hamming spaces, A nowhere-zero point in linear mappings, An identity in combinatorial extremal theory, Codes with given distances, \(L\)-balancing families, Covering symmetric sets of the Boolean cube by affine hyperplanes, Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits, \(d\)-Galvin families, Sphere coverings and identifying codes, Unnamed Item, Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms, On efficient high-order spectral-null codes over them-ary alphabet, Lower Bounds for Syntactically Multilinear Algebraic Branching Programs