On linear balancing sets

Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2699-2703
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint Dive into the research topics of 'On linear balancing sets'. Together they form a unique fingerprint.

Cite this