A lower bound on the optimum distance profiles of the second-order Reed-Muller codes

In this paper, we give a lower bound for the optimum distance profiles of the second-order Reed-Muller code in the dictionary order and in the inverse dictionary order. In particular, we investigate the second-order Reed-Muller codes of length <= 256. We show that the bound is tight in both orders for the codes of length <= 128.