English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In the Galois fields GF(2n), a polynomial basis with a small number of trace-one elements is desirable for its convenience in computing. To find new irreducible polynomials g(x) over GF(2) with this property, we research into the auxiliary polynomial f(x)=(x+1)g(x) with roots {1,α1,α2,…,αn}, such that the symmetric polynomials sk=1+α1k+α2k+⋯+αnk are relative to the symmetric polynomials of g(x). We introduce a new class of polynomials with the number “1” occupying most of the values in its sk. This indicates that the number “0” occupies most of the values of the traces of the elements {α1,α2,…,αn}. This new class of polynomial gives us an indirect way to find irreducible polynomials having a small number of trace-one elements in their polynomial bases

mathematical problems in engineering

On the Polynomial Basis of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mi mathvariant="normal">G</mml:mi><mml:mi mathvariant="normal">F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mn fontstyle="italic">2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math>Having a Small Number of Trace-One Elements

On the Polynomial Basis ofGF(2n)Having a Small Number of Trace-One Elements