Balancing sets of vectors

DOI10.1109/18.2610zbMath0647.94018OpenAlexW2035175249MaRDI 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 matrixconstruction of signal sets for optical data links

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (16)

Covering symmetric sets of the Boolean cube by affine hyperplanes ⋮ Codes with given distances ⋮ Unnamed Item ⋮ Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ Sphere coverings and identifying codes ⋮ An identity in combinatorial extremal theory ⋮ On splitting and splittable families ⋮ On identifying codes in binary Hamming spaces ⋮ Lower Bounds for Syntactically Multilinear Algebraic Branching Programs ⋮ \(d\)-Galvin families ⋮ 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 ⋮ Unnamed Item ⋮ A nowhere-zero point in linear mappings ⋮ Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits ⋮ \(L\)-balancing families

This page was built for publication: Balancing sets of vectors