Locally recoverable code: Difference between revisions

Content deleted Content added
Line 26:
== Tamo-Barg Codes ==
 
Let f ∈ Fq [X] be a polynomial and let l be a positive integer.
Then f is said to be (r, l)-good if
 
• f has degree r + 1,
• there exist A 1 , . . . Al distinct subsets of Fq such that
– for any i ∈ {1, . . . l}, f (A i ) = {t i } for some ti ∈ F q , i.e. f is constant
on Ai ,
– #A i = r + 1,
– Ai ∩ A j = ∅ for any i ≠ j.
We say that {A1 , . . . , A l } is a splitting covering for f .
 
'''Tamo Barg Construction'''