Decoding algorithms with input quantization and maximum error correction capability

1995 ◽  
Vol 41 (4) ◽  
pp. 1126-1133 ◽  
Author(s):  
A. Hassan ◽  
W. Stark
Keyword(s):  
Error Correction ◽  
Maximum Error ◽  
Input Quantization ◽  
Decoding Algorithms ◽  
Error Correction Capability

A partial transmit sequence technique with error correction capability and low computation

2013 ◽  
Vol 27 (12) ◽  
pp. 4014-4027 ◽  
Author(s):  
Hsin-Ying Liang ◽  
Hung-Chi Chu ◽  
Chuan-Bi Lin ◽  
Kuang-Hao Lin
Keyword(s):  
Error Correction ◽  
Partial Transmit Sequence ◽  
Error Correction Capability

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

“Soft Error” Correction Method Based on Low Complexity Coding and Encoding Algorithm

2014 ◽  
Vol 556-562 ◽  
pp. 6344-6349
Author(s):  
Yan Kang Wei ◽  
Da Ming Wang ◽  
Wei Jia Cui
Keyword(s):  
Fault Tolerance ◽  
Error Correction ◽  
Fault Tolerant ◽  
Low Complexity ◽  
Correction Method ◽  
Block Codes ◽  
Decoding Algorithms ◽  
Linear Block Codes ◽  
Data Errors ◽  
Linear Block

SEU is one of the major challenges affecting the reliability of computers on-board. In this paper, we design a kind of encoding and decoding algorithms with a low complexity based on the data correction method to resolve the data stream errors SEU may bring. Firstly, we use the theory of linear block codes to analyze various methods of data fault tolerance, and then from the encoding and decoding principle of linear block codes we design a kind of encoding and decoding algorithms with a low complexity of linear block code, The fault-tolerant coding method can effectively correct single-bit data errors caused by SEU, with low fault-tolerant overhead. Fault injection experiments show that: this method can effectively correct data errors caused by single event upset. Compared with other common error detection or correction methods, error correction performance of this method is superior, while its fault tolerance cost is less.

Sign in / Sign up

Export Citation Format

Share Document