265 citations · 344 across the 15 of their papers we have counts for
8 papers · 1 filter
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister +1
Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple noisy copies which can be combined to produce better estimates of the original strand; this i…
Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities
Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs…
New Constructions of SD and MR Codes over Small Finite Fields
Guangda Hu, Sergey Yekhanin
Data storage applications require erasure-correcting codes with prescribed sets of dependencies between data symbols and redundant symbols. The most common arrangement is to have $…
Maximally Recoverable Codes for Grid-like Topologies
Parikshit Gopalan, Guangda Hu, Swastik Kopparty +3
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in…
Explicit Maximally Recoverable Codes with Locality
Parikshit Gopalan, Cheng Huang, Bob Jenkins +1
Consider a systematic linear code where some (local) parity symbols depend on few prescribed symbols, while other (heavy) parity symbols may depend on all data symbols. Local parit…
On the Locality of Codeword Symbols in Non-Linear Codes
Michael Forbes, Sergey Yekhanin
Consider a possibly non-linear (n,K,d)_q code. Coordinate i has locality r if its value is determined by some r other coordinates. A recent line of work obtained an optimal trade-o…