On the bounds and achievability about the ODPC of $\mathcal{G}\mathcal{R}\mathcal{M}(2,m{)}^{\ast }$ over prime field for increasing message length

Xiaogang Liu, Yuan Luo

The optimum distance profiles of linear block codes were studied for increasing or decreasing message length while keeping the minimum distances as large as possible, especially fo…