On linear balancing sets
Abstract
Let n be an even positive integer and F be the field (2). A word in Fn is called balanced if its Hamming weight is n/2. A subset C ⊂eq Fn$ is called a balancing set if for every word y ∈ Fn there is a word x ∈ C such that y + x is balanced. It is shown that most linear subspaces of Fn of dimension slightly larger than 3/22(n) are balancing sets. A generalization of this result to linear subspaces that are "almost balancing" is also presented. On the other hand, it is shown that the problem of deciding whether a given set of vectors in Fn spans a balancing set, is NP-hard. An application of linear balancing sets is presented for designing efficient error-correcting coding schemes in which the codewords are balanced.
0