Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq

DOI10.1016/S0304-0208(08)73491-1zbMATH Open0505.12023MaRDI QIDQ4740646FDOQ4740646

Authors: Paul Camion 

Publication date: 1982

Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

zbMATH Keywords

algorithmfactorizationfinite fieldprimitive idempotent

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Conditions on elements (16U99)

Cited In (3)

• Univariate polynomial factorization over finite fields
• Factoring polynomials over finite fields: A survey
• On splitting sets in block designs and finding roots of polynomials

This page was built for publication: Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740646)