adv

Improvement on the Redundancy of the Knuth Balancing Scheme for Communication Systems. (arXiv:1711.03525v1 [cs.IT])

A simple scheme was proposed by Knuth to generate balanced codewords from a random binary information sequence. However, this method presents a redundancy which is twice as that of the full sets of balanced codewords, that is the minimal achievable redundancy. The gap between the Knuth's algorithm generated redundancy and the minimal one is significantly considerable and can be reduced. This paper attempts to achieve this goal through a method based on information sequence candidates. The proposed scheme is suitable for various communication systems as it generates very efficient and less redundant balanced codes.查看全文

Solidot 文章翻译

你的名字

留空匿名提交
你的Email或网站

用户可以联系你
标题

简单描述
内容