Higher order MDS codes
Abstract/Contents
- Abstract
- In the field of coding theory, maximum-distance separable (MDS) codes are a class of codes which have optimal guarantees for correcting worst-case Hamming errors. Geometrically, such codes correspond to configurations of vectors in
Description
| Type of resource | text |
|---|---|
| Form | electronic resource; remote; computer; online resource |
| Extent | 1 online resource. |
| Place | California |
| Place | [Stanford, California] |
| Publisher | [Stanford University] |
| Copyright date | 2023; ©2023 |
| Publication date | 2023; 2023 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Author | Brakensiek, Joshua |
|---|---|
| Degree supervisor | Charikar, Moses |
| Degree supervisor | Rubinstein, Aviad |
| Thesis advisor | Charikar, Moses |
| Thesis advisor | Rubinstein, Aviad |
| Thesis advisor | Guruswami, Venkatesan |
| Thesis advisor | Wootters, Mary |
| Degree committee member | Guruswami, Venkatesan |
| Degree committee member | Wootters, Mary |
| Associated with | Stanford University, School of Engineering |
| Associated with | Stanford University, Computer Science Department |
Subjects
| Genre | Theses |
|---|---|
| Genre | Text |
Bibliographic information
| Statement of responsibility | Joshua Brakensiek. |
|---|---|
| Note | Submitted to the Computer Science Department. |
| Thesis | Thesis Ph.D. Stanford University 2023. |
| Location | https://purl.stanford.edu/rc211rc7517 |
Access conditions
- Copyright
- © 2023 by Joshua Brakensiek
Also listed in
Loading usage metrics...