42 citations · 161 across the 18 of their papers we have counts for
1 paper · 2 filters
Daniel Cullina, Negar Kiyavash
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes.…