@inproceedings{9d6a0c8575f14e43b950f39db55c8bdb,

title = "On linear balancing sets",

abstract = "Let n be an even positive integer and F be the field GF(2). A word in Fn is called balanced if its Hamming weight is n/2. A subset C F n 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/2 log2 n are balancing sets. An application of linear balancing sets is presented for designing efficient error-correcting coding schemes in which the codewords are balanced.",

author = "Arya Mazumdar and Roth, {Ron M.} and Vontobel, {Pascal O.}",

year = "2009",

doi = "10.1109/ISIT.2009.5205879",

language = "English (US)",

isbn = "9781424443130",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2699--2703",

booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

note = "2009 IEEE International Symposium on Information Theory, ISIT 2009 ; Conference date: 28-06-2009 Through 03-07-2009",

}