Pages that link to "Item:Q2491249"
From MaRDI portal
The following pages link to On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\) (Q2491249):
Displayed 10 items.
- Complexity of computation in finite fields (Q378003) (← links)
- The parity of the number of irreducible factors for some pentanomials (Q623239) (← links)
- A Swan-like theorem (Q814767) (← links)
- On the linear complexity of Sidel'nikov sequences over nonprime fields (Q958251) (← links)
- The trace spectra of polynomial bases for \(\mathbb F_{2^n}\) (Q1016580) (← links)
- On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements (Q1793753) (← links)
- Addendum to Sidel'nikov sequences over nonprime fields (Q2450931) (← links)
- A note on the reducibility of binary affine polynomials (Q2638417) (← links)
- An efficient deterministic test for Kloosterman sum zeros (Q2862534) (← links)
- Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic (Q5452253) (← links)