Parameters of recursive MDS-codes (Q2708298)

Given an alphabet \(\Omega\), a full \(m\)-recursive code over \(\Omega\) consists of segments of recurring sequences that satisfy a recursivity law \(f:\Omega^m \rightarrow \Omega\). Full \(m\)-recursive codes are related to orthogonal systems of \(m\)-quasigroups. An MDS code is a code meeting the Singleton bound, i.e. an \([n,k,n-k+1]\) code. The authors give conditions for which recursive MDS codes exist. They build on results from their previous paper showing that the largest length for which a full \(m\)-recursive code over an alphabet of size \(q\) exists is greater than or equal to \(q+1\) for primary \(q\) with \(1\leq m \leq q\) and is \(2^t+2\) when \(m=2^t-1\), \(q=2^t\) for \(t=2,3,4.\)