Self-conjugate-reciprocal irreducible monic factors of \(x^{n}-1\) over finite fields and their applications
DOI10.1016/j.ffa.2018.09.004zbMath1404.11134arXiv1804.06138OpenAlexW2963804899WikidataQ62577963 ScholiaQ62577963MaRDI QIDQ1633284
Somphong Jitman, Arunwan Boripan, Pattanee Udomkavanich
Publication date: 19 December 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.06138
self-reciprocal polynomialscomplementary dual cyclic codesself-conjugate-reciprocal polynomialsself-dual cyclic codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06)
Related Items (8)
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
- Hermitian LCD codes from cyclic codes
- Hulls of cyclic and negacyclic codes over finite fields
- Hermitian Self-Dual Abelian Codes
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On some properties of self-reciprocal polynomials (Corresp.)
- On the divisors of $a^k + b^k$
- On Self-Dual Cyclic Codes Over Finite Fields
This page was built for publication: Self-conjugate-reciprocal irreducible monic factors of \(x^{n}-1\) over finite fields and their applications