Generating matrices of highest order over a finite field

Simple item page
dc.creatorChoudhury, Piyasi
dc.date2005-11-27
dc.date.accessioned2026-07-07T06:51:46Z
dc.date.available2026-07-07T06:51:46Z
dc.descriptionShift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such matrices over GF(2) has been presented. A technique for counting all such n x n matrices over GF(2) is also presented. The technique may be easily extended to other finite fields.
dc.identifierhttps://arxiv.org/abs/math/0511651
dc.identifierhttp://arxiv.org/abs/math/0511651
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105098
dc.subjectGroup Theory
dc.titleGenerating matrices of highest order over a finite field
dc.typetext

Files

Collections

arXiv