A construction for balancing non-binary sequences based on gray code prefixes

Elie N. Mambou; Theo G. Swart

doi:10.1109/TIT.2017.2766668

A construction for balancing non-binary sequences based on gray code prefixes

Elie N. Mambou, Theo G. Swart

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Contribution to journal › Article › peer-review

12 Citations (Scopus)

Abstract

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 algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel.

Original language	English
Pages (from-to)	5961-5969
Number of pages	9
Journal	IEEE Transactions on Information Theory
Volume	64
Issue number	8
DOIs	https://doi.org/10.1109/TIT.2017.2766668
Publication status	Published - Aug 2018

Keywords

Balanced sequence
DC-free codes
Gray code prefix

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2017.2766668

Cite this

@article{cffdae1c36ab434ea208e0155e3339c6,

title = "A construction for balancing non-binary sequences based on gray code prefixes",

abstract = "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 algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel.",

keywords = "Balanced sequence, DC-free codes, Gray code prefix",

author = "Mambou, {Elie N.} and Swart, {Theo G.}",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2018",

month = aug,

doi = "10.1109/TIT.2017.2766668",

language = "English",

volume = "64",

pages = "5961--5969",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - A construction for balancing non-binary sequences based on gray code prefixes

AU - Mambou, Elie N.

AU - Swart, Theo G.

PY - 2018/8

Y1 - 2018/8

N2 - 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 algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel.

AB - 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 algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel.

KW - Balanced sequence

KW - DC-free codes

KW - Gray code prefix

UR - http://www.scopus.com/inward/record.url?scp=85032458638&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2766668

DO - 10.1109/TIT.2017.2766668

M3 - Article

AN - SCOPUS:85032458638

SN - 0018-9448

VL - 64

SP - 5961

EP - 5969

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

ER -

A construction for balancing non-binary sequences based on gray code prefixes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this