2013 · 39 citations · 7 references
Natural SciencesComputer ScienceMathematicsAlgebraCryptographyInformation TheoryAbstract AlgebraCoding TheoryError-correcting CodesGalois TheoryGroup TheoryCodes Over Finite FieldsFrobenius AutomorphismGabidulin CodesLinear CodesPolynomial Time ComplexityPolynomial-time AlgorithmsRank-metric Codes
We transpose the theory of rank metric and Gabidulin codes to the case of fields of characteristic zero. The Frobenius automorphism is then replaced by any element of the Galois group. We derive some conditions on the automorphism to be able to easily transpose the results obtained by Gabidulin as well and a classical polynomial-time decoding algorithm. We also provide various definitions for the rank-metric.
7
Theory of Non-Commutative Polynomials
Öystein Ore · Annals of Mathematics · 1933 · 801 citations
On a special class of polynomials
Öystein Ore · Transactions of the American Mathematical Society · 1933 · 233 citations · Full text