DSpace Repository

Problema căutării polinoamelor ireductibile asupra extensiei câmpurilor Galois

Show simple item record

dc.contributor.author BODEAN, D.
dc.contributor.author BODEAN, Gh.
dc.date.accessioned 2019-12-04T11:30:26Z
dc.date.available 2019-12-04T11:30:26Z
dc.date.issued 2012
dc.identifier.citation BODEAN, D., BODEAN, Gh. Problema căutării polinoamelor ireductibile asupra extensiei câmpurilor Galois. In: Telecommunication, Electronics and Informatics - ICTEI 2012: proc. of the 4th intern. conf., Technical University of Moldova, May 17-20, 2012. Chișinău, 2012, Vol. 2, pp. 73-78. ISBN 978-9975-45-082-9. en_US
dc.identifier.isbn 978-9975-45-082-9
dc.identifier.uri http://repository.utm.md/handle/5014/7242
dc.description.abstract In this work the solution of searching irreducible polynomials over extension Galois field is presented. The proposed algorithm is based on the trace generation and testing the subperiods resulted from factorization the field’s Euler indicator. Algorithm complexity is NPpolynomial. The searching results shows that the expected number of irreducible polynomials differ from the expected one known. en_US
dc.language.iso ro en_US
dc.publisher Tehnica UTM en_US
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject Galois field extention en_US
dc.subject irreducible polynomial en_US
dc.title Problema căutării polinoamelor ireductibile asupra extensiei câmpurilor Galois en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account