Explicit subcodes of Reed-Solomon product codes achieve optimal minimum distance for dimensions r²-1, r²-2 and all dimensions ≤2r-1, together with a new upper bound on the minimum distance of any subcode of a product of two identical codes.
Repair locality from a combinatorial perspec- tive
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
Explicit subcodes of Reed-Solomon product codes achieve optimal minimum distance for dimensions r²-1, r²-2 and all dimensions ≤2r-1, together with a new upper bound on the minimum distance of any subcode of a product of two identical codes.