Balanced code
In coding theory, a balanced code is a 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;[1] 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 errors in an encoded message. Balanced codes allow for particularly efficient decoding, which can be carried out in parallel.[1][2]
References
- ^ a b D.E. Knuth (January 1986). "Efficient balanced codes" (PDF). IEEE Transactions on Information Theory. 32 (1): 51–53. doi:10.1109/TIT.1986.1057136.
- ^ Sulaiman Al-Bassam; Bella Bose (March 1990). "On Balanced Codes". IEEE Transactions on Information Theory. 36 (2): 406–408. doi:10.1109/18.52490.
 | This redirect has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar redirects, in addition to a stub category. (April 2012) |
 | This article related to telecommunications is a stub. You can help Wikipedia by expanding it. |