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 we show the usability of the Gray code with constant weightwords for computing linear combinations of codewords. This can lead to a bigimprovement of the computation time for finding the minimum distance of a code.We have also considered the usefulness of combinatorial $2$-$(t,k,1)$ designswhen there are memory limitations to the number of objects (linear codes inparticular) that can be tested for equivalence.

A note on reducing the computation time for minimum distance and equivalence check of binary linear codes