Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2

DOI10.1007/BF01270930zbMath0818.11046MaRDI QIDQ1340509

Hervé Chabanne

Publication date: 28 August 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

finite fieldprimitive idempotentsdeterministic algorithmcomplete factorization of \(x^ n -1\)tower of extensions

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic number theory computations (11Y40)

Related Items

Univariate polynomial factorization over finite fields

Cites Work

• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• The concatenated structure of cyclic and Abelian codes
• A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p^m) of GF(p), p a Small Prime
• The Structure and Properties of Binary Cyclic Alphabets
• Coding theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item