SRIM and SCRIM factors of xn + 1 over finite fields and their applications
From MaRDI portal
Publication:5859513
DOI10.1142/S1793830920500986zbMath1464.11136arXiv1909.03826OpenAlexW3080385177MaRDI QIDQ5859513
Somphong Jitman, Arunwan Boripan
Publication date: 16 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03826
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Cyclic codes (94B15)
Related Items (1)
Cites Work
- Enumeration formulas for self-dual cyclic codes
- Self-reciprocal irreducible polynomials over finite fields
- The condition for a cyclic code to have a complementary dual
- On LCD negacyclic codes over finite fields
- Self-conjugate-reciprocal irreducible monic factors of \(x^{n}-1\) over finite fields and their applications
- Good integers and some applications in coding theory
- Some generalizations of good integers and their applications in the study of self-dual negacyclic codes
- Hulls of cyclic and negacyclic codes over finite fields
- Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
- Hermitian Self-Dual Abelian Codes
- On some properties of self-reciprocal polynomials (Corresp.)
- On the divisors of $a^k + b^k$
- Enumeration of self-dual cyclic codes of some specific lengths over finite fields
- Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes
- On Self-Dual Cyclic Codes Over Finite Fields
- Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes
This page was built for publication: SRIM and SCRIM factors of xn + 1 over finite fields and their applications