No label defined (Q4500988)

Recursive MDS-codes and recursive differentiable \(k\)-quasigroups are studied. The notion of a full \(k\)-recursive code is introduced. A code \(K\subset \Omega^n\) over an alphabet \(\Omega = \{a_1,\dots,a_q\}\) is full \(k\)-recursive if there exists a function \(f\:\Omega ^k \to \Omega\), \(k<n\), such that \(K\) consists of all words \((u(0),\dots,u(n-1))\), where \(u(i+k)=f(u(i),\dots,u(i+k-1))\) for \(i=0,\dots,n-k\) and \(u(0),\dots,u(k-1)\) are arbitrary elements of \(\Omega\). Such a code is denoted by \(K(n,f)\). Let \(n^r(k,q)\) be the maximal \(n\) such that there exists a full \(k\)-recursive MDS-code. The case \(k=2\) is considered. It is proven that a quasigroup \(f\:\Omega ^2 \to \Omega\) is recursive \(t\)-differentiable for a natural \(t\) if and only if the code \(K(t+3,f)\) is an MDS-code. Necessary conditions for the existence of a differentiable quasigroup are obtained. These results make it possible to establish that, for every natural \(q\) except \(1,2,6\) and (possibly) \(14,18,26,42\), the inequality \(n^r(2,q)\geq 4\) is valid. Some results which sharpen this inequality for \(q<100\) are presented. For the entire collection see [Zbl 0918.00043].