Parity Schemes is a data redundancy technique that belongs to the class of error-detection and fault-tolerance methods, distinguished by its use of parity bits to compute and store auxiliary information enabling the detection and recovery of data corruption or loss in storage systems.
110
Publications
4.5K
Citations
264
Authors
105
Institutions
Publications per year
2017–2026
6
Parents
Publications
110
Row-diagonal parity for double disk failure correction
Peter Corbett, Bob English, Atul Goel et al. · 2004 · 493 citations
1–5 of 110
Authors
264
- MB
5
h-index
- AG
4
h-index
- PCPeter Corbett
IBM Research - Thomas J. Watson Research Center, United States
4 publications · 622 citations
4
h-index
- JM
4
h-index
- SSSunitha Sankar
3 publications · 585 citations
3
h-index
1–5 of 264
Institutions
105
IBM Research - Almaden
San Jose, United States
8 h-index
17 publications
821 citations
IBM (United States)
Armonk, United States
7 h-index
10 publications
402 citations
Santa Clara University
Santa Clara, United States
5 h-index
6 publications
391 citations
Politecnico di Milano
Milan, Italy
4 h-index
12 publications
387 citations
Techniques of Informatics and Microelectronics for Integrated Systems Architecture
Grenoble, France
4 h-index
9 publications
392 citations
University of California, Santa Cruz
Santa Cruz, United States
4 h-index
7 publications
369 citations
Huazhong University of Science and Technology
Wuhan, China
3 h-index
10 publications
322 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
6 publications
151 citations
1–8 of 105
Venues
- IEEE Transactions on Computers
6 publications · 163 citations
7
h-index
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
3 publications · 104 citations
3
h-index
- Animal Science
2 publications · 32 citations
2
h-index
- Journal of Animal Science
2 publications · 53 citations
2
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 43 citations
2
h-index
1–5