A Construction for Balancing Non-Binary Sequences Based on Gray Code Prefixes

  title={A Construction for Balancing Non-Binary Sequences Based on Gray Code Prefixes},
  author={Elie Ngomseu Mambou and Theo G. Swart},
  journal={IEEE Transactions on Information Theory},
We introduce a new construction for the balancing of non-binary sequences that make use of Gray codes for prefix coding. Our construction provides full encoding and decoding of sequences, including the prefix. This construction is based on a generalization of Knuth’s parallel balancing approach, which can handle very long information sequences. However, the overall sequence—composed of the information sequence, together with the prefix—must be balanced. This is reminiscent of Knuth’s serial… 

Figures and Tables from this paper

Improving the redundancy of Knuth’s balancing scheme for packet transmission systems

This paper proposes an efficient way to perform a full balancing scheme that does not make use of lookup tables or enumerative coding.

Improvement on the Redundancy of the Knuth Balancing Scheme for Communication Systems

This paper attempts to achieve the minimal achievable redundancy through a method based on information sequence candidates which is suitable for various communication systems as it generates very efficient and less redundant balanced codes.

Improving the Redundancy of the Knuth Balancing Scheme for Packet Transmission Systems

This paper attempts to achieve the minimal achievable redundancy in Knuth's algorithm through a method based on information candidates, which is suitable for various communication systems as it generates verycient and less redundant balanced codes.

Construction of Efficient q-ary Balanced Codes

This article presents a simple and efficient method to encode the prefix that results in less redundancy for the construction of q-ary balanced codewords.

Improved DC-Free Run-Length Limited 4B6B Codes for Concatenated Schemes

Simulations show that the proposed 4B 6B code concatenated with forward error correction (FEC) codes, has better performance compared to state-of-the-art schemes such as the original 4B6B code, the enhanced Miller code,the Manchester code,The 5B10B code and the (0,4) 2/3 RLL code.

Design of balanced $q$ -ary interleaved sequences

The aim of interleaving the codebooks is to increase the robustness of DC free codes toward burst errors whilst maintaining their spectral shaping property.

Efficient Flicker-Free FEC Codes Using Knuth's Balancing Algorithm for VLC

This paper proposes an efficient construction of flicker-free forward error correction codes to tackle the issue of flickering in VLC by using polar codes and at a dimming ratio of 50%, while having lower complexity and higher transmission rates than the standard VLC methods.

An Improved Cellular Automata-Based Classifier with Soft Decision

A new classifier is proposed, called Cellular Automata-Based Classifier with Soft Decision (CAS), which replaces the GA with the promising optimization algorithm, called Butterfly Optimization, for the rule ordering process and improves the classification performance by augmenting a Soft-Decision step.

Efficient Channel Coding for Dimmable Visible Light Communications System

A coding scheme that is flicker-free, provides a simple encoding structure, does not utilize lookup tables, generates minimal number of redundancies for energy efficiency, and is more suitable for real-time VLC systems is proposed.



Encoding and decoding of balanced q-ary sequences using a Gray code prefix

  • E. N. MambouT. Swart
  • Computer Science
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
It is shown how non-binary Gray codes can be used to generate prefixes that form a complete balancing system with straightforward and efficient encoding/decoding.

Very Efficient Balanced Codes

A new construction of sets of balanced codewords is presented, which is simple, does not use look-up tables, and is less redundant than Knuth's construction.

Balanced Codes with Parallel Encoding and Decoding

A balanced code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2/sup k/ such that the number of 1s in each code word is equal to [n/2]. This paper describes


It is shown that the Tower of Hanoi problem, in which disks can only be moved to the adjacent pegs, can be solved by enumerating the (3, k)-Gray code, where k is the number of disks to be moved.

Knuth’s balancing of codewords revisited

This paper presents results of attempts to improve the performance of Knuthpsilas balanced codes, a very simple algorithm for constructing sets of bipolar codewords with equal numbers of dasia1psil as and dasia-1psils, called balanced codes.

Efficient q-ary immutable codes

On m-ary balanced codes with parallel decoding

This paper presents a tight generalization of Knuth's complementation method with parallel decoding scheme, which uses r check digits to balance k ≤ (m<sup>r</sup> −1)/(m−1) information digits.

On balanced codes

The 2/sup 2/-r-1 construction given by D.E. Knuth is improved and the new codes are shown to be optimal when Knuth's complementation method is used.

On Unordered Codes

  • B. Bose
  • Computer Science
    IEEE Trans. Computers
  • 1991
By extending the results obtained by D. E. Knuth (1986), a parallel unordered coding scheme with 2/sup r/ information bits is described. Balanced codes in which each codeword contains equal amounts

On Generating the N-ary Reflected Gray Codes

  • M. Er
  • Computer Science
    IEEE Transactions on Computers
  • 1984
It is proven that the N-ary reflected Gray code is cyclic when its Radix is even, but not cyclic, in general, when its radix is odd.