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 this paper, we first provide some properties of truth tables of bent functions. Furthermore, a upper bound of truth table's runs length of a bent function is presented. Based on these results, we propose a new algorithm for enumerating bent functions. At last, we find that our algorithm requires lower storage complexity and is easier to implement with parallel/distributed computing infrastructures by comparing with some known searching algorithms.

A New Algorithm for Enumerating Bent Functions Based on Truth Tables and Run Length