Computer Science – Information Theory
Scientific paper
2009-01-21
Advances in Mathematics of Communications (AMC), Vol. 4, Issue 3, pp. 345 - 361, August, 2010
Computer Science
Information Theory
The abstract of this paper appeared in the proc. of 2009 International Symposium on Information Theory
Scientific paper
10.3934/amc.2010.4.345
Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y + x is balanced. It is shown that most linear subspaces of F^n of dimension slightly larger than 3/2\log_2(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 F^n 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.
Mazumdar Arya
Roth Ron M.
Vontobel Pascal O.
No associations
LandOfFree
On linear balancing sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On linear balancing sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On linear balancing sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-683990