2007/12/31 by Ryan Hutchinson, Hutchinson, Ryan
Computer Science · Mathematics · #94B10 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Optimization and Control (math.OC) #cs.IT #math.IT #math.OC #msc:94B10
paper · pdf · doi:10.48550/arxiv.0801.0184
17 pages
arxiv created 2007/12/31 · arxiv updated 2009/12/01
It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters (n,k,δ). It has been conjectured that the same is true for convolutional codes that are strongly maximum distance separable. Using methods from linear systems theory, we resolve this conjecture by showing that, over a large enough finite field of any characteristic, codes which are simultaneously maximum distance profile and strongly maximum distance separable exist for all parameters (n,k,δ).