Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming

Abstract

The size of the largest binary single deletion code has been unknown for more than 50 years. It is known that Varshamov-Tenengolts (VT) code is an optimum single deletion code for block length n <= 10; however, only a few upper bounds of the size of single deletion code are proposed for larger n. We provide improved upper bounds using Mixed Integer Linear Programming (MILP) relaxation technique. Especially, we show the size of single deletion code is smaller than or equal to 173 when the block length n is 11. In the second half of the paper, we propose a conjecture that is equivalent to the long-lasting conjecture that "VT code is optimum for all n". This equivalent formulation of the conjecture contains small sub-problems that can be numerically verified. We provide numerical results that support the conjecture.