May 4, 2015 · This paper presents efficient encoding schemes to m-ary balanced codes with parallel (hence, fast) decoding. In fact, the decoding time ...

This paper presents efficient encoding schemes to m-ary balanced codes with parallel (hence, fast) decoding. In fact, the decoding time complexity is O(1) digit ...

This paper presents a tight generalization of Knuth's complementation method with parallel (hence, fast) decoding scheme. Let ( w n ) m indicate the number of m ...

This study proposes a generalization of this algorithm for q-ary sequences (multiplexed sequences, clock-controlled sequences, geometric sequences). This new ...

Balanced codes have found applications in various systems, such as optical and magnetic recording, cable transmissions, detection of unidirectional errors and ...

This paper gives some efficient methods to convert (encode) m-ARY information sequences into m-ary SPI-balanced codes whose redundancy is equal to roughly ...

Pelusi et al. [14] gave a generalization of Knuth's scheme for obtaining efficient m-ary balanced codes with a parallel decoding scheme. ...

Abstract—We will present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information on ...

The proposed codes are less redundant than the m-ary balanced codes with parallel decoding found in the literature and yet maintain the same complexity.

On efficient balanced codes over the mth roots of unity · Balanced Codes with Parallel Encoding and Decoding · Design of Balanced and Constant Weight Codes for ...