We provide short proofs for all floor bounds and most order bounds and formulate the DP and DK order bounds as natural but different generalizations of the Feng-Rao bound for one-point codes.Expand

The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound.Expand

The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound.Expand

In 1990, Kostochka and Sidorenko proposed studying the smallest number of list-colorings of a graph G among all assignments of lists of a given size n to its vertices. We say a graph G isâ€¦ Expand