A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH decoder codes.>
No takes yet. Share an insight, caveat, or question.
Justesen et al. (1989) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: