On the improvement of the Knuth’s redundancy algorithm for balancing codes
- Esenogho, Ebenezer, Mambou, Elie N., Ferreira, Hendrik C.
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced code , Inversion point , Redundancy
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/403533 , uj:33820 , Citation: Esenogho, E., Mambou, E.N. & Ferreira, H.C. 2019. On the improvement of the Knuth’s redundancy algorithm for balancing codes.
- Description: Abstract: 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.
- Full Text:
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced code , Inversion point , Redundancy
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/403533 , uj:33820 , Citation: Esenogho, E., Mambou, E.N. & Ferreira, H.C. 2019. On the improvement of the Knuth’s redundancy algorithm for balancing codes.
- Description: Abstract: 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.
- Full Text:
Prefixless q-ary balanced codes with fast syndrome-based error correction
- Swart, Theo G., Weber, Jos H., Schouhamer Immink, Kees A.
- Authors: Swart, Theo G. , Weber, Jos H. , Schouhamer Immink, Kees A.
- Date: 2018
- Subjects: Balanced code , Constrained code , error correction
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/279793 , uj:30054 , Citation: Swart, T.G., Weber, J.H. & Schouhamer Immink, K.A. 2018. Prefixless q-ary balanced codes with fast syndrome-based error correction. IEEE Transactions on Information Theory, 64(4):2431-2443. DOI:10.1109/TIT.2017.2767034
- Description: Abstract: We investigate a Knuth-like scheme for balancing q-ary codewords, which has the virtue that look-up tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends on syndromes only, making it considerably faster compared to the prior art exhaustive decoding strategy. A comparison between the new and prior art schemes, both in terms of redundancy and error performance, completes the study.
- Full Text:
- Authors: Swart, Theo G. , Weber, Jos H. , Schouhamer Immink, Kees A.
- Date: 2018
- Subjects: Balanced code , Constrained code , error correction
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/279793 , uj:30054 , Citation: Swart, T.G., Weber, J.H. & Schouhamer Immink, K.A. 2018. Prefixless q-ary balanced codes with fast syndrome-based error correction. IEEE Transactions on Information Theory, 64(4):2431-2443. DOI:10.1109/TIT.2017.2767034
- Description: Abstract: We investigate a Knuth-like scheme for balancing q-ary codewords, which has the virtue that look-up tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends on syndromes only, making it considerably faster compared to the prior art exhaustive decoding strategy. A comparison between the new and prior art schemes, both in terms of redundancy and error performance, completes the study.
- Full Text:
- «
- ‹
- 1
- ›
- »