10 citations · 22 across the 6 of their papers we have counts for
4 papers · 1 filter
Codes with hierarchical locality from covering maps of curves
Sean Ballentine, Alexander Barg, Serge Vladuts
Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes w…
Locally recoverable codes on algebraic curves
Alexander Barg, Itzhak Tamo, Serge Vladuts
A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most ) other symbols of the codeword.…
On the Doubly Sparse Compressed Sensing Problem
Grigory Kabatiansky, Cedric Tavernier, Serge Vladuts
A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restricti…
Locally recoverable codes on algebraic curves
Alexander Barg, Itzhak Tamo, Serge Vladut
A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most r) other symbols. A family of linear…