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...
Main Authors: | Weber, Jos H., Immink, Kees A. Schouhamer., Ferreira, Hendrik C. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/96031 http://hdl.handle.net/10220/11461 |
Similar Items
-
High-rate maximum runlength constrained coding schemes using nibble replacement
by: Immink, Kees A. Schouhamer.
Published: (2013) -
Properties and Constructions of Constrained Codes for DNA-Based Data Storage
by: Kees A. Schouhamer Immink, et al.
Published: (2020-01-01) -
Knuth's Problem
by: Bird, R
Published: (1991) -
Two-dimensional RC/SW constrained codes: bounded weight and almost balanced weight
by: Nguyen, Tuan Thanh, et al.
Published: (2023) -
Mirabolic Robinson-Shensted-Knuth correspondence
by: Travkin, Roman
Published: (2009)