5 citations · 7 across the 4 of their papers we have counts for
4 papers · 1 filter
Cayley-Bacharach and evaluation codes on complete intersections
Leah Gold, John Little, Hal Schenck
In recent work, J. Hansen uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in the proje…
A map on the space of rational functions
G. Boros, J. Little, V. Moll +2
We describe dynamical properties of a map defined on the space of rational functions. The fixed points of are classified and the long time behavior of…
A key equation and the computation of error values for codes from order domains
John B. Little
We study the computation of error values in the decoding of codes constructed from order domains. Our approach is based on a sort of analog of the key equation for decoding Reed-So…
The Ubiquity of Order Domains for the Construction of Error Control Codes
John B. Little
The order domains are a class of commutative rings introduced by Høholdt, van Lint, and Pellikaan to simplify the theory of error control codes using ideas from algebraic geometry.…