Very Efficient Balanced Codes

Abstract

The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a factor of two short with respect to the minimum required. We present a new construction, which is simple, does not use look-up tables, and is less… (More)
DOI: 10.1109/JSAC.2010.100207

Topics

3 Figures and Tables

Statistics

050100201520162017
Citations per Year

Citation Velocity: 32

Averaging 32 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Immink2010VeryEB, title={Very Efficient Balanced Codes}, author={Kees A. Schouhamer Immink and Jos H. Weber}, journal={IEEE Journal on Selected Areas in Communications}, year={2010}, volume={28} }