On the number of zero trace elements in polynomial bases for F₂^n
From MaRDI portal
Publication:558716
zbMATH Open1069.11051MaRDI QIDQ558716FDOQ558716
Authors: Igor E. Shparlinski
Publication date: 13 July 2005
Published in: Revista Matemática Complutense (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/44549
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Other types of codes (94B60)
Cited In (6)
- On counting absolute trace of powers inGF(p m )
- Addendum to Sidel'nikov sequences over nonprime fields
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
- Title not available (Why is that?)
- The trace spectra of polynomial bases for \(\mathbb F_{2^n}\)
- On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements
This page was built for publication: On the number of zero trace elements in polynomial bases for \(\mathbb F_{2^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558716)