Subspace Codes
Subspace Codes is a type of error-correcting code in which the codewords are subspaces of a vector space over a finite field, endowed with a metric based on the subspace distance, enabling robust communication in network coding under errors and erasures.
127
Publications
4.6K
Citations
205
Authors
150
Institutions
Publications per year
2017–2026
55
Parents
127
Explicit construction of optimal exact regenerating codes for distributed storage
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar et al. · 2009 · 301 citations
1–5 of 127
205
6
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 205
150
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
16 publications
659 citations
University of Bayreuth
Bayreuth, Germany
7 h-index
11 publications
274 citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
6 h-index
14 publications
346 citations
Nanyang Technological University
Singapore, Singapore
5 h-index
6 publications
139 citations
National University of Singapore
Singapore, Singapore
4 h-index
4 publications
223 citations

University of Toronto
Toronto, Canada
4 h-index
8 publications
644 citations

University of Campania "Luigi Vanvitelli"
Caserta, Italy
4 h-index
10 publications
193 citations
University of Washington
Seattle, United States
4 h-index
5 publications
622 citations
1–8 of 150
31 publications · 1.3K citations
20
h-index
6 publications · 153 citations
6
h-index
Repository · 6 publications · 133 citations
6
h-index
4 publications · 76 citations
4
h-index
4 publications · 91 citations
4
h-index
1–5