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

Until this work, the packing radius of a poset code was only known in thecases where the poset was a chain, a hierarchy, a union of disjoint chains ofthe same size, and for some families of codes. Our objective is to approach thegeneral case of any poset. To do this, we will divide the problem into twoparts.  The first part consists in finding the packing radius of a single vector. Wewill show that this is equivalent to a generalization of a famous NP-hardproblem known as "the partition problem". Then, we will review the main resultsknown about this problem giving special attention to the algorithms to solveit. The main ingredient to these algorithms is what is known as thedifferentiating method, and therefore, we will extend it to the general case.  The second part consists in finding the vector that determines the packingradius of the code. For this, we will show how it is sometimes possible tocompare the packing radius of two vectors without calculating them explicitly.

The Packing Radius of a Code and Partitioning Problems: the Case for Poset Metrics