Error-correcting balanced Knuth codes

Knuth's celebrated balancing method consists of inverting the first bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index to the receiver through a short balanced prefix. In the proposed method, Knuth's scheme is ext...

Full description

Saved in:
Bibliographic Details
Main Authors: Weber, Jos H., Immink, Kees A. Schouhamer., Ferreira, Hendrik C.
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2013
Online Access:https://hdl.handle.net/10356/96031
http://hdl.handle.net/10220/11461
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-96031
record_format dspace
spelling sg-ntu-dr.10356-960312020-03-07T12:31:25Z Error-correcting balanced Knuth codes Weber, Jos H. Immink, Kees A. Schouhamer. Ferreira, Hendrik C. School of Physical and Mathematical Sciences Knuth's celebrated balancing method consists of inverting the first bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index to the receiver through a short balanced prefix. In the proposed method, Knuth's scheme is extended with error-correcting capabilities, where it is allowed to give unequal protection levels to the prefix and the payload. The proposed scheme is very general in the sense that any error-correcting block code may be used for the protection of the payload. Analyses with respect to redundancy and block and bit error probabilities are performed, showing good results while maintaining the simplicity features of the original scheme. It is shown that the Hamming distance of the code is of minor importance with respect to the error probability. 2013-07-15T08:13:36Z 2019-12-06T19:24:42Z 2013-07-15T08:13:36Z 2019-12-06T19:24:42Z 2011 2011 Journal Article Weber, J. H., Immink, K. A. S., & Ferreira, H. C. (2012). Error-Correcting Balanced Knuth Codes. IEEE Transactions on Information Theory, 58(1), 82-89. 0018-9448 https://hdl.handle.net/10356/96031 http://hdl.handle.net/10220/11461 10.1109/TIT.2011.2167954 en IEEE transactions on information theory © 2011 IEEE.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
description Knuth's celebrated balancing method consists of inverting the first bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index to the receiver through a short balanced prefix. In the proposed method, Knuth's scheme is extended with error-correcting capabilities, where it is allowed to give unequal protection levels to the prefix and the payload. The proposed scheme is very general in the sense that any error-correcting block code may be used for the protection of the payload. Analyses with respect to redundancy and block and bit error probabilities are performed, showing good results while maintaining the simplicity features of the original scheme. It is shown that the Hamming distance of the code is of minor importance with respect to the error probability.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Weber, Jos H.
Immink, Kees A. Schouhamer.
Ferreira, Hendrik C.
format Article
author Weber, Jos H.
Immink, Kees A. Schouhamer.
Ferreira, Hendrik C.
spellingShingle Weber, Jos H.
Immink, Kees A. Schouhamer.
Ferreira, Hendrik C.
Error-correcting balanced Knuth codes
author_sort Weber, Jos H.
title Error-correcting balanced Knuth codes
title_short Error-correcting balanced Knuth codes
title_full Error-correcting balanced Knuth codes
title_fullStr Error-correcting balanced Knuth codes
title_full_unstemmed Error-correcting balanced Knuth codes
title_sort error-correcting balanced knuth codes
publishDate 2013
url https://hdl.handle.net/10356/96031
http://hdl.handle.net/10220/11461
_version_ 1681045289502244864