scholarly journals Small weight bases for hamming codes

1995 ◽  
pp. 235-243
Author(s):  
John Tromp ◽  
Louxin Zhang ◽  
Ying Zhao
Keyword(s):  
Small Weight ◽  
Hamming Codes

scholarly journals Small weight bases for hamming codes

1997 ◽  
Vol 181 (2) ◽  
pp. 337-345 ◽  
Author(s):  
John Tromp ◽  
Louxin Zhang ◽  
Ying Zhao
Keyword(s):  
Small Weight ◽  
Hamming Codes

scholarly journals Low-Degree Spanning Trees of Small Weight

1996 ◽  
Vol 25 (2) ◽  
pp. 355-368 ◽  
Author(s):  
Samir Khuller ◽  
Balaji Raghavachari ◽  
Neal Young
Keyword(s):  
Spanning Trees ◽  
Small Weight ◽  
Low Degree

scholarly journals Graphenes as additives in photoelectrocatalysis

2017 ◽  
Vol 5 (32) ◽  
pp. 16522-16536 ◽  
Author(s):  
Alejandra García ◽  
Cristina Fernandez-Blanco ◽  
Jose R. Herance ◽  
Josep Albero ◽  
Hermenegildo García
Keyword(s):  
Electrical Conductivity ◽  
Surface Area ◽  
Large Surface Area ◽  
Small Weight ◽  
Charge Mobility

Due to the electrical conductivity, charge mobility and large surface area, graphenes in small weight percentages can increase the efficiency of semiconductors in photoelectrodes. The review covers CO2 generation, H2 evolution and pollutants degradation.

scholarly journals Hamming Codes: Error Reducing Techniques

2021 ◽  
Vol 9 (11) ◽  
pp. 1972-1974
Author(s):  
Rohitkumar R Upadhyay
Keyword(s):  
Lower Bound ◽  
Error Correction ◽  
Coding Theory ◽  
Hamming Distance ◽  
Error Reduction ◽  
Error Correcting Codes ◽  
Significant Other ◽  
Hamming Codes ◽  
Decoding Algorithms ◽  
Reducing Properties

Abstract: Hamming codes for all intents and purposes are the first nontrivial family of error-correcting codes that can actually correct one error in a block of binary symbols, which literally is fairly significant. In this paper we definitely extend the notion of error correction to error-reduction and particularly present particularly several decoding methods with the particularly goal of improving the error-reducing capabilities of Hamming codes, which is quite significant. First, the error-reducing properties of Hamming codes with pretty standard decoding definitely are demonstrated and explored. We show a sort of lower bound on the definitely average number of errors present in a decoded message when two errors for the most part are introduced by the channel for for all intents and purposes general Hamming codes, which actually is quite significant. Other decoding algorithms are investigated experimentally, and it generally is definitely found that these algorithms for the most part improve the error reduction capabilities of Hamming codes beyond the aforementioned lower bound of for all intents and purposes standard decoding. Keywords: coding theory, hamming codes, hamming distance

Sign in / Sign up

Export Citation Format

Share Document