Self-reciprocal polynomials and coterm polynomials
From MaRDI portal
Publication:1650429
DOI10.1007/s10623-017-0419-4zbMath1414.11162arXiv1606.07750OpenAlexW2963410844MaRDI QIDQ1650429
Publication date: 3 July 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07750
Polynomials in number theory (11C08) Polynomials over finite fields (11T06) Cyclic codes (94B15) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Reversed Dickson polynomials of the (\(k+1\))-th kind over finite fields
- Cyclic codes over \(\mathbb F_2[u/(u^4-1)\) and applications to DNA codes]
- Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance]
- Necklaces, self-reciprocal polynomials, and \(q\)-cycles
- Necessary conditions for reversed Dickson polynomials to be permutational
- Self-reciprocal irreducible polynomials over finite fields
- Necessary conditions for reversed Dickson polynomials of the second kind to be permutational
- Necklaces, symmetries and self-reciprocal polynomials
- The condition for a cyclic code to have a complementary dual
- Constructions of good entanglement-assisted quantum error correcting codes
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- Reversible Codes and Applications to DNA
- On some properties of self-reciprocal polynomials (Corresp.)
- Reversible codes
This page was built for publication: Self-reciprocal polynomials and coterm polynomials