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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, a genetic algorithm, one of the evolutionary algorithmsoptimization methods, is used for the first time for the problem of findingextremal binary self-dual codes. We present a comparison of the computationaltimes between a genetic algorithm and a linear search for different size searchspaces and show that the genetic algorithm is capable of finding binaryself-dual codes significantly faster than the linear search. Moreover, byemploying a known matrix construction together with the genetic algorithm, weare able to obtain new binary self-dual codes of lengths 68 and 72 in asignificantly short time. In particular, we obtain 11 new extremal binaryself-dual codes of length 68 and 17 new binary self-dual codes of length 72.

A Novel Genetic Search Scheme Based on Nature -- Inspired Evolutionary Algorithms for Self-Dual Codes