Generalized Singleton Type Upper Bounds

In this paper, we give many new Singleton type upper bounds on the sizes of codes with given minimum Hamming distances. These upper bounds are stronger than the Griesmer bound when the lengths of codes are large. Some upper bounds on the lengths of general small Singleton defect codes are presented. Our generalized Singleton type upper bounds have wide applications to symbol-pair codes, insertion-deletion codes and locally recoverable codes. The generalized Singleton type upper bounds on symbol-pair codes and insertion-deletion codes are much stronger than the direct Singleton bounds on symbol-pair codes and insertion-deletion codes when the lengths are large and the Hamming minimum distances are small. Upper bounds on the lengths of small dimension optimal locally recoverable codes and small dimension optimal (r, δ) locally recoverable codes with any given minimum distance are also presented.