Binary balanced codes approaching capacity
- Esenogho, Ebenezer, Mambou, Elie N., Swart, Theo G., Ferreira, Hendrik C.
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Swart, Theo G. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced codes , Redundancy , Binary alphabet
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/401121 , uj:33508 , Citation: Esenogho, E. et al. 2019. Binary balanced codes approaching capacity.
- Description: Abstract: In this paper, the construction of binary balanced codes is revisited. Binary balanced codes refer to sets of bipolar codewords where the number of “1”s in each codeword equals that of “0”s. The first algorithm for balancing codes was proposed by Knuth in 1986; however, its redundancy is almost two times larger than that of the full set of balanced codewords. We will present an efficient and simple construction with a redundancy approaching the minimal achievable one.
- Full Text:
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Swart, Theo G. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced codes , Redundancy , Binary alphabet
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/401121 , uj:33508 , Citation: Esenogho, E. et al. 2019. Binary balanced codes approaching capacity.
- Description: Abstract: In this paper, the construction of binary balanced codes is revisited. Binary balanced codes refer to sets of bipolar codewords where the number of “1”s in each codeword equals that of “0”s. The first algorithm for balancing codes was proposed by Knuth in 1986; however, its redundancy is almost two times larger than that of the full set of balanced codewords. We will present an efficient and simple construction with a redundancy approaching the minimal achievable one.
- Full Text:
Improving the redundancy of Knuth’s balancing scheme for packet transmission systems
- Ngomseu Mambou, Elie, Esenogho, Ebenezer, Ferreira, Hendrik C.
- Authors: Ngomseu Mambou, Elie , Esenogho, Ebenezer , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced codes , Binary word , Parallel decoding
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/398841 , uj:33221 , Citation: Ngomseu M.E., Esenogho, E. & Ferreira, H. 2019. Improving the redundancy of Knuth’s balancing scheme for packet transmission systems. Turkish Journal of Electrical Engineering & Computer Sciences.
- Description: Abstract: 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.
- Full Text:
- Authors: Ngomseu Mambou, Elie , Esenogho, Ebenezer , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced codes , Binary word , Parallel decoding
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/398841 , uj:33221 , Citation: Ngomseu M.E., Esenogho, E. & Ferreira, H. 2019. Improving the redundancy of Knuth’s balancing scheme for packet transmission systems. Turkish Journal of Electrical Engineering & Computer Sciences.
- Description: Abstract: 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.
- Full Text:
Integrating enhanced sparse autoencoder-based artificial neural network technique and softmax regression for medical diagnosis
- Ebiaredoh-Mienye, Sarah A., Esenogho, Ebenezer, Swart, Theo G.
- Authors: Ebiaredoh-Mienye, Sarah A. , Esenogho, Ebenezer , Swart, Theo G.
- Date: 2020
- Subjects: Sparse autoencoder , Unsupervised learning , Softmax regression
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/457861 , uj:40645 , DOI: 10.3390/electronics9111963 , Citation: Ebiaredoh-Mienye, S.A., Esenogho, E. & Swart, T.G. 2020. Integrating enhanced sparse autoencoder-based artificial neural network technique and softmax regression for medical diagnosis.
- Description: Abstract: Please refer to full text to view abstract.
- Full Text:
- Authors: Ebiaredoh-Mienye, Sarah A. , Esenogho, Ebenezer , Swart, Theo G.
- Date: 2020
- Subjects: Sparse autoencoder , Unsupervised learning , Softmax regression
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/457861 , uj:40645 , DOI: 10.3390/electronics9111963 , Citation: Ebiaredoh-Mienye, S.A., Esenogho, E. & Swart, T.G. 2020. Integrating enhanced sparse autoencoder-based artificial neural network technique and softmax regression for medical diagnosis.
- Description: Abstract: Please refer to full text to view abstract.
- Full Text:
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:
- «
- ‹
- 1
- ›
- »