Maximum Distance Separable Codes
Maximum Distance Separable Codes is an error-correcting code that achieves the maximum possible minimum distance for a given code length and dimension, thereby providing optimal error detection and correction capabilities under the Singleton bound.
190
Publications
11.2K
Citations
358
Authors
208
Institutions
Publications per year
2017–2026
55
190
Quantum error-correcting codes associated with graphs
D. Schlingemann, Reinhard F. Werner · Physical Review A · 2001 · 412 citations · Full text
Markus Grassl, Thomas Beth, Martin Rötteler · International Journal of Quantum Information · 2004 · 296 citations · Full text
1–5 of 190
358
9
h-index
8
h-index
7
h-index
Korea Advanced Institute of Science and Technology, South Korea
6 publications · 664 citations
6
h-index
6
h-index
1–5 of 358
208
Nanyang Technological University
Singapore, Singapore
11 h-index
24 publications
1.6K citations
University of California, Berkeley
Berkeley, United States
10 h-index
21 publications
1.7K citations
IBM Research - Almaden
San Jose, United States
8 h-index
10 publications
988 citations
California Institute of Technology
Pasadena, United States
7 h-index
10 publications
658 citations

Hefei University of Technology
Hefei, China
7 h-index
19 publications
2K citations
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
11 publications
892 citations
University of Maryland, College Park
College Park, United States
6 h-index
8 publications
398 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
6 h-index
13 publications
358 citations
1–8 of 208
68 publications · 5.6K citations
43
h-index
11 publications · 402 citations
11
h-index
12 publications · 358 citations
10
h-index
Repository · 4 publications · 141 citations
4
h-index
IJQI · 3 publications · 359 citations
3
h-index
1–5