Factorization of composed polynomials and applications

DOI10.1016/j.disc.2019.111603zbMath1421.11094arXiv1901.02951OpenAlexW2965469980MaRDI QIDQ2329189

Fabio Enrique Brochero Martínez, Lucas Reis, Lays Silva-Jesus

Publication date: 17 October 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.02951

zbMATH Keywords

finite fieldscyclotomic polynomialsirreducible polynomials\(\lambda\)-constacyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Cyclic codes (94B15)

Related Items

A recurrent construction of irreducible polynomials of fixed degree over finite fields, Constructions of irreducible polynomials over finite fields with even characteristic, Factorization of Dickson polynomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)]
• A class of constacyclic codes over a finite field
• Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)]
• The primitive idempotents and weight distributions of irreducible constacyclic codes
• Further factorization of \(x^n - 1\) over a finite field
• On the Chor-Rivest knapsack cryptosystem
• Repeated-root constacyclic codes of length \(n l p^s\)
• Cyclic Subgroups of the Prime Residue Group