2013 IEEE International Conference of IEEE Region 10 (TENCON 2013) 2013
DOI: 10.1109/tencon.2013.6718953
|View full text |Cite
|
Sign up to set email alerts
|

Research and implementation of SEC-DED Hamming code algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…The works of [14][15][16][17][18][19][20][21][22][23][24][25] show that the ECCs most widely used in space applications are Low-Density Parity Code (LDPC), Hamming, Reed-Muller (RM), Bose-Chaudhuri-Hocquenghem (BCH), Product code, Reed-Solomon and its variations. Erosan and Tavli [14] exploit LDPC to detect adjacent errors in SRAMs.…”
Section: Introductionmentioning
confidence: 99%
“…The works of [14][15][16][17][18][19][20][21][22][23][24][25] show that the ECCs most widely used in space applications are Low-Density Parity Code (LDPC), Hamming, Reed-Muller (RM), Bose-Chaudhuri-Hocquenghem (BCH), Product code, Reed-Solomon and its variations. Erosan and Tavli [14] exploit LDPC to detect adjacent errors in SRAMs.…”
Section: Introductionmentioning
confidence: 99%
“…A complete Hamming code is an H-matrix of r-row with entire the 2r-1 unique non-zero columns. The complete Hamming codes are K = 2r-1 and N = 2r-1 [5]. This method can only identify and correct one error.…”
Section: Hamming Code Algorithmmentioning
confidence: 99%
“…It was invented by Ritchard Hamming in 1950. Hamming code has ability to detect and corrected the single bit error, with a minimum hamming distance [6]. In general the parity bits are used to detect and correct the single error.…”
Section: Hamming Code For Error Detection and Correctionmentioning
confidence: 99%