research
∙
12/15/2022
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix
Linearized Reed-Solomon (LRS) codes are a class of evaluation codes base...
share
research
∙
01/05/2022
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors
Motivated by applications to DNA-storage, flash memory, and magnetic rec...
research
∙
08/22/2021
Sequence Reconstruction for Limited-Magnitude Errors
Motivated by applications to DNA storage, we study reconstruction and li...
research
∙
07/21/2021
On the Generalized Covering Radii of Reed-Muller Codes
We study generalized covering radii, a fundamental property of linear co...
research
∙
09/18/2020
Improved Coding over Sets for DNA-Based Data Storage
Error-correcting codes over sets, with applications to DNA storage, are ...
research
∙
05/30/2020
On Tilings of Asymmetric Limited-Magnitude Balls
We study whether an asymmetric limited-magnitude ball may tile ℤ^n. This...
research
∙
05/29/2020
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls
We construct integer error-correcting codes and covering codes for the l...
research
∙
01/13/2020
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
We study scalar-linear and vector-linear solutions to the generalized co...
research
∙
12/31/2019
Robust Positioning Patterns with Low Redundancy
A robust positioning pattern is a large array that allows a mobile devic...
research
∙
01/04/2019
Efficient and Explicit Balanced Primer Codes
To equip DNA-based data storage with random-access capabilities, Yazdi e...
research
∙
08/16/2018
