Choi et al.'s optimal-code characterization of the LCP lower bound
Choi et al.'s conjecture. There exists a unique binary optimal [n,k,dL(n,k)][n,k,d_L(n,k)][n,k,dL​(n,k)] code CCC which is even-like and contains 1{\bf1}1 if and only if