1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Matt Keti, Daqing Wan
For an [n,k] Reed-Solomon code C, it can be shown that any received word r lies a distance at most n−k from C, denoted d(r,C)≤n−k. Any…