Parameters of recursive MDS-codes
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.\)
- Some classes of the MDS matrices over a finite field
- Pseudogeometries with clusters and an example of a recursive \([4,2,3]_{42}\)-code
- Victor Timofeevich Markov (21.06.1948 -- 15.07.2019)
- Linear recursive MDS-codes and Asturian codes
- Construction of Recursive MDS Diffusion Layers from Gabidulin Codes
- scientific article; zbMATH DE number 3877080 (Why is no real title available?)
- scientific article; zbMATH DE number 1498797 (Why is no real title available?)
- scientific article; zbMATH DE number 1504666 (Why is no real title available?)
- Recursive MDS-codes and recursive differentiable quasigroups
- Linear recursive MDS codes of dimensions 2 and 3
- Recursively r-differentiable quasigroups within S-systems and MDS-codes
- Experimental methods for constructing MDS matrices of a special form
- On recursively differentiable k-quasigroups
- On the order of recursive differentiability of finite binary quasigroups
- On the circulant matrix MDS testing and the search for circulant MDS matrices
This page was built for publication: Parameters of recursive MDS-codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708298)
