Answers are grounded in this paper and cite their sources.
Certainq-ary Reed-Solomon codes can be decoded by an algorithm requiring onlyO(q log² q)additions and multiplications inGF(q).
No takes yet. Share an insight, caveat, or question.
J. Justesen (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: