Using bit recycling to reduce Knuth's balanced codes redundancy

Al-Rababa'a, Ahmad; Dube, Danny; Chouinard, Jean‐Yves

doi:10.1109/cwit.2013.6621583

Search citation statements

Order By: Relevance

Paper Sections

Select...

Analysis and Discussion1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2019

Publication Types

Select...

Article3

Other3

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 6 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The average number of bits for the method in [9] is given by…”

Section: Analysis and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…The average number of bits for the method in [9] is given by…”

Section: Analysis and Discussionmentioning

confidence: 99%

“…The second attempt from [8] was exploited in [9] and renamed as bit recycling for Knuth's algorithm (BRKA); it relies on a high probability of having more than one balancing index while performing KA. In other words, this scheme uses the multiplicity of balancing indexes to encode a shorter prefix than that from KA.…”

Section: Introductionmentioning

confidence: 99%