8
Our Approach
We generalize Chlamtac and Farago’s approach:
1)Any code can be used for scheduling
- for large, sparse networks, Hermitian
codes give
better minimum performance guarantees
than RS
codes
2) Chlamtac and
Farago’s construction results in a
singly extended Reed-Solomon code
3)
Optimality of Ju and Li’s: only true if underlying code
is singly extended RS code, using doubly
extended
RS codes provides better guarantees, for
example
4) What about average case performance?