Content deleted Content added
→top: hyphenation |
m clean up, replaced: IEEE Journal on Selected Areas of Communications → IEEE Journal on Selected Areas in Communications, removed stub tag |
||
Line 36:
In [[coding theory]], a '''balanced code''' is a [[binary numeral system|binary]] [[forward error correction]] code for which each codeword contains an equal number of zero and one bits. Balanced codes have been introduced by [[Donald Knuth]];<ref name="knuth">{{cite journal|author=D.E. Knuth|title=Efficient balanced codes|journal=IEEE Transactions on Information Theory|volume=32|issue=1|pages=51–53|date=January 1986|doi=10.1109/TIT.1986.1057136|url=http://www.costasarrays.org/costasrefs/knuth86efficient.pdf}}</ref> they are a subset of so-called unordered codes, which are codes having the property that the positions of ones in a codeword are never a subset of the positions of the ones in another codeword. Like all unordered codes, balanced codes are suitable for the detection of all [[unidirectional error]]s in an encoded message. Balanced codes allow for particularly efficient decoding, which can be carried out in parallel.<ref name="knuth"/><ref name="optimal">{{cite journal|author1=Sulaiman Al-Bassam|author2=Bella Bose|title=On Balanced Codes|journal=IEEE Transactions on Information Theory|volume=36|issue=2|pages=406–408|date=March 1990|doi=10.1109/18.52490}}</ref><ref>{{Cite journal
|journal= IEEE Journal on Selected Areas
|volume=28
|date=2010
Line 42:
|author=[[Kees Schouhamer Immink|K. Schouhamer Immink]] and J. Weber
|url=https://www.researchgate.net/publication/224110287_Very_Efficient_Balanced_Codes
|pages=
|accessdate=2018-02-12
}}</ref>
Some of the more notable uses of balanced-weight codes include
Line 100:
[[Category:Information theory]]
[[Category:Error detection and correction]]
| |||