FUFelix Ulmer
Felix Ulmer
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Felix Ulmer has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Delphine Boucher
Univ Rennes, CNRS, IRMAR - UMR 6625, Rennes Cedex, France
2 shared publications - Alexander Pott
Otto von Guericke University Magdeburg, Faculty of Mathematics, Institute for Algebra and Geometry
1 shared publication - Anne Canteaut
INRIA Paris-Rocquencourt
1 shared publication - Cornelia Ott
Institute of Communications and Navigation, German Aerospace Center (DLR), Germany
1 shared publication D. Boucher
IRMAR, Université de Rennes 1, Rennes Cedex, France
1 shared publication- Gohar M. Kyureghyan
University of Rostock, Rostock, Germany
1 shared publication
Latest Publications
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (6) , 1723-1741
A Gröbner approach to dual-containing cyclic left module $ (\theta,\delta) $-codes over finite commutative Frobenius rings
For a skew polynomial ring $ R = A[X;\theta, \delta] $ where $ A $ is a commutative Frobenius ring, $ \theta $ an endomorphism of $ A $ and $ \delta $ a $ \theta $-derivation of $ A $, we consider cyclic left module codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ where $ g $ is a left and right divisor of $ f $ in $ R $. In this paper, we derive a parity check matrix when $ A $ is a finite commutative Frobenius ring using only the framework of skew polynomial rings. We consider rings $ A = B[a_1, \ldots, a_s] $ which are free $ B $-modules where the restriction of $ \delta $ and $ \theta $ to $ B $ are polynomial maps. If a Gröbner basis can be computed over $ B $, then we show that all Euclidean and Hermitian dual-containing codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ can be computed using a Gröbner basis. We also give an algorithm to test if the dual code is again a cyclic left module code. We illustrate our approach for rings of order $ 4 $ with non-trivial endomorphism and the Galois ring of characteristic $ 4 $.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (6) , 1723-1741
A Gröbner approach to dual-containing cyclic left module $ (\theta,\delta) $-codes over finite commutative Frobenius rings
For a skew polynomial ring $ R = A[X;\theta, \delta] $ where $ A $ is a commutative Frobenius ring, $ \theta $ an endomorphism of $ A $ and $ \delta $ a $ \theta $-derivation of $ A $, we consider cyclic left module codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ where $ g $ is a left and right divisor of $ f $ in $ R $. In this paper, we derive a parity check matrix when $ A $ is a finite commutative Frobenius ring using only the framework of skew polynomial rings. We consider rings $ A = B[a_1, \ldots, a_s] $ which are free $ B $-modules where the restriction of $ \delta $ and $ \theta $ to $ B $ are polynomial maps. If a Gröbner basis can be computed over $ B $, then we show that all Euclidean and Hermitian dual-containing codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ can be computed using a Gröbner basis. We also give an algorithm to test if the dual code is again a cyclic left module code. We illustrate our approach for rings of order $ 4 $ with non-trivial endomorphism and the Galois ring of characteristic $ 4 $.- 1 September 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (9) , 1699
Editorial: Coding and Cryptography 2019
- 1 September 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (9) , 1699
Editorial: Coding and Cryptography 2019
- Open Access
Duality Preserving Gray Maps for Codes over Rings
Given a finite ring $A$ which is a free left module over a subring $R$ of $A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace orthogonal bases) and symmetric bases, are defined which in turn are used to define duality preserving maps from codes over $A$ to codes over $R$. Both types of bases are generalizations of similar concepts for fields. Many illustrative examples are given to shed light on the advantages to such mappings as well as their abundance.Open AccessDuality Preserving Gray Maps for Codes over Rings
Given a finite ring $A$ which is a free left module over a subring $R$ of $A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace orthogonal bases) and symmetric bases, are defined which in turn are used to define duality preserving maps from codes over $A$ to codes over $R$. Both types of bases are generalizations of similar concepts for fields. Many illustrative examples are given to shed light on the advantages to such mappings as well as their abundance. - 1 January 2015
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 83-86
Extended Abstract: Codes as Modules over Skew Polynomial Rings
- 1 January 2015
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 83-86
Extended Abstract: Codes as Modules over Skew Polynomial Rings
- 1 January 2014
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 60, 47-61
Self-dual skew codes and factorization of skew polynomials
- 1 January 2014
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 60, 47-61
Self-dual skew codes and factorization of skew polynomials
- 15 August 2008
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 50 (3) , 267-284
Skew codes of prescribed distance or rank
- 15 August 2008
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 50 (3) , 267-284
Skew codes of prescribed distance or rank
- Open Access
- 1 January 2008
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 2 (3) , 273-292
Skew constacyclic codes over Galois rings
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over $GR(4, 2)$ are constructed. Euclidean self-dual codes give self-dual $\mathbb Z_4$−codes. Hermitian self-dual codes yield 3−modular lattices and quasi-cyclic self-dual $\mathbb Z_4$−codes.- 1 January 2008
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 2 (3) , 273-292
Open AccessSkew constacyclic codes over Galois rings
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over $GR(4, 2)$ are constructed. Euclidean self-dual codes give self-dual $\mathbb Z_4$−codes. Hermitian self-dual codes yield 3−modular lattices and quasi-cyclic self-dual $\mathbb Z_4$−codes. - Top Cited Papers
- 2 June 2007
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 18 (4) , 379-389
Skew-cyclic codes
- 2 June 2007
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 18 (4) , 379-389
Top Cited PapersSkew-cyclic codes