Construction of q-ary constant weight sequences using a knuth-like approach

Mambou, Elie Ngomseu; Swart, Theo G.

doi:10.1109/isit.2017.8006885

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed construction is more efficient and less redundant than various schemes; it does not make use of lookup tables or enumerative coding. Future works include a further compression of the prefix length for overall balancing through advanced efficient constructions such as in [16][17][18]. On the other hand, we can extend the proposed algorithm to investigate the efficient balancing of q -ary sequences as higher alphabets, especially powers of twos, as they present various advantages in communication systems in terms of reducing latency, improving communication speed, and increasing robustness and reliability [19][20][21][22].…”

Section: Discussionmentioning

confidence: 99%

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

Mambou¹,

Esenogho²,

Ferreira³

2019

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

A simple scheme was proposed by Knuth to generate binary balanced codewords from any information word.However, this method is limited in the sense that its redundancy is twice that of the full sets of balanced codes. The gap between Knuth's algorithm's redundancy and that of the full sets of balanced codes is significantly considerable. This paper attempts to reduce that gap. Furthermore, many constructions assume that a full balancing can be performed without showing the steps. A full balancing refers to the overall balancing of the encoded information together with the prefix. We propose an efficient way to perform a full balancing scheme that does not make use of lookup tables or enumerative coding.

show abstract