2 problems

Let $\Omega$ be an alphabet of size $q$. A complete $2$-recursive code is determined by a function $f:\Omega^2\to\Omega$, with successive symbols generated from the preceding two s…

A complete $2$-recursive code of length $n$ is specified by a function $f$ through the recurrence … for $l>2$, and it is an MDS code when its associated groupoid is a recursively d…