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

Mixed Hamming packings are considered: the maximal cardinality given aminimum codeword Hamming distance of mixed codes is addressed via mixed integerprogramming models. Adopting the concept of contact graph from classicalcontinuous sphere packing problems, a reduction technique for the models isintroduced, which enables their efficient solution. Several best known upperbounds are improved and some of them are found to be sharp.

Reduction and efficient solution of MILP models of mixed Hamming packings yielding improved upper bounds