15 citations · 24 across the 7 of their papers we have counts for
8 papers
The list size of random linear codes at capacity
Shashwat Silas
Let be a uniformly random -linear code of rate , and let be the least such that every Hamming ball of…
Real-time oblivious erasure correction with linear time decoding and constant feedback
Shashwat Silas
We continue the study of rateless codes for transmission of information across channels whose rate of erasure is unknown. In such a code, an infinite stream of encoding symbols can…
Threshold rates for properties of random codes
Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch +2
Suppose that is a property that may be satisfied by a random code . For example, for some , might be the property that there exist three eleme…
Bounds for list-decoding and list-recovery of random linear codes
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff +3
A family of error-correcting codes is list-decodable from error fraction if, for every code in the family, the number of codewords in any Hamming ball of fractional radius …
LDPC Codes Achieve List Decoding Capacity
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi +2
We show that Gallager's ensemble of Low-Density Parity Check (LDPC) codes achieves list-decoding capacity with high probability. These are the first graph-based codes shown to have…
Load-Balanced Fractional Repetition Codes
Alexandra Porter, Shashwat Silas, Mary Wootters
We introduce load-balanced fractional repetition (LBFR) codes, which are a strengthening of fractional repetition (FR) codes. LBFR codes have the additional property that multiple…
Randomly Generated Subgroups of the Symmetric Group and Random Lifts of Graphs
Shashwat Silas
Amit and Linial showed that a random lift of a graph with minimum degree is asymptotically almost surely -connected, and mentioned the problem of estimating this probabi…
On the Inversion Polynomial for Dedekind Sums
Yiwang Chen, Nicholas Dunn, Campbell Hewett +1
We introduce the inversion polynomial for Dedekind sums to study the number of which have the same value for given . We prove…