Prefixless q-ary Balanced Codes with Fast Syndrome-Based Error Correction

We investigate a Knuth-like scheme for balancing q-ary code words, which has the virtue that lookup tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends...

Bounds and constructions for binary block codes correcting asymmetric or unidirectional errors