Abstract
We describe a construction of error-correcting codes on a fibration over a curve defined over a finite field, which may be considered as a relative version of the classical Reed–Muller code. In the case of complete intersections in a projective bundle, we give an explicit lower bound for the minimum distance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have