Paper Info
Title
Improving the Redundancy of the Knuth Balancing Scheme for Packet Transmission Systems.
Abstract
A simple scheme was proposed by Knuth to generate balanced codewords from a random binary in- formation sequence. However, this method presents a redundancy which is twice that of the full sets of bal- anced codewords, that is the minimal achievable redun- dancy. The gap between the Knuthu0027s algorithm gen- erated redundancy and the minimal one is significant and can be reduced. This paper attempts to achieve this goal through a method based on information se- quence candidates. The proposed scheme is suitable for various communication systems as it generates very ef- ?cient and less redundant balanced codes.
Year
DOI
Venue
2017
10.3906/ELK-1810-112
arXiv: Information Theory
Field
DocType
Volume
Packet transmission,Computer science,Algorithm,Communications system,Theoretical computer science,Redundancy (engineering),Binary number
Journal
abs/1711.03525
Issue
Citations 
PageRank 
4
0
0.34
References 
Authors
2
3
Name
Order
Citations
PageRank
Ebenezer Esenogho102.03
Elie Ngomseu Mambou201.01
Hendrik C. Ferreira319543.56