Abstract
The recursive derivatives of an algebraic operation are defined in [1], where they appear as control mappings of complete recursive codes. It is proved in [1], in particular, that the recursive derivatives of order up to r of a finite binary quasigroup (Q, ·) are quasigroup operations if and only if (Q, ·) defines a recursive MDS-code of length r + 3. The author of the present note gives an algebraic proof of an equivalent statement: a finite binary quasigroup (Q, ·) is recursively r-differentiable (r ≥ 0) if and only if the system consisting of its recursive derivatives of order up to r and of the binary selectors, is orthogonal. This involves the fact that the maximum order of recursive differentiability of a finite binary quasigroup of order q does not exceed q − 2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
