Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.01105 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911560352399360 |
|---|---|
| author | Klimov, Petr |
| author_facet | Klimov, Petr |
| contents | In 1998, E. Couselo, S. González, V. T. Markov, and A. A. Nechaev introduced the notions of recursive codes and recursively differentiable quasigroups. They conjectured that recursive MDS codes of dimension $2$ and length $4$ exist over every finite alphabet of size $q \not\in \{2, 6\}$, and verified this conjecture in all cases except $q \in \{14, 18, 26, 42\}$. In 2008, V. T. Markov, A. A. Nechaev, S. S. Skazhenik, and E. O. Tveritinov resolved the case $q=42$ by providing an explicit construction. The present paper settles the outstanding case $q=26$. The construction rests upon methods for producing recursively differentiable quasigroups and recursive MDS codes via perfect cyclic Mendelsohn designs. Moreover, we sharpen several known bounds concerning the existence of recursively $n$-differentiable quasigroups of small orders. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_01105 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code Klimov, Petr Information Theory Combinatorics In 1998, E. Couselo, S. González, V. T. Markov, and A. A. Nechaev introduced the notions of recursive codes and recursively differentiable quasigroups. They conjectured that recursive MDS codes of dimension $2$ and length $4$ exist over every finite alphabet of size $q \not\in \{2, 6\}$, and verified this conjecture in all cases except $q \in \{14, 18, 26, 42\}$. In 2008, V. T. Markov, A. A. Nechaev, S. S. Skazhenik, and E. O. Tveritinov resolved the case $q=42$ by providing an explicit construction. The present paper settles the outstanding case $q=26$. The construction rests upon methods for producing recursively differentiable quasigroups and recursive MDS codes via perfect cyclic Mendelsohn designs. Moreover, we sharpen several known bounds concerning the existence of recursively $n$-differentiable quasigroups of small orders. |
| title | On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2604.01105 |