Existence of strongly MDS convolutional codes with maximum distance profile

A convolutional code with parameters (n,k,δ)(n,k,\delta) has length nn, dimension kk, and degree δ\delta. It is strongly MDS if it attains the strongly MDS distance bound, and it has a maximum distance profile if its column distances attain the corresponding upper bounds.

Existence conjecture. For all n>k>0n>k>0 and for all δ0\delta\geq 0 there exists an (n,k,δ)(n,k,\delta) code over a sufficiently large field which is both strongly MDS and has a maximum distance profile.

The paper proves existence for all parameters with k=n1k=n-1 and reports computer searches producing such codes for many small parameter values. The conjecture asks for existence for all admissible parameters.

Sources & referencesView supporting material

Primary source

Heide Gluesing-Luerssen, Joachim Rosenthal and Roxana Smarandache, “Strongly MDS Convolutional Codes”, arXiv:math/0303254 (2003).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.