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 will estimate the main parameters of some evaluation codeswhich are known as projective parameterized codes. We will find the length ofthese codes and we will give a formula for the dimension in terms of theHilbert function associated to two ideals, one of them being the vanishingideal of the projective torus. Also we will find an upper bound for the minimumdistance and, in some cases, we will give some lower bounds for the regularityindex and the minimum distance. These lower bounds work in several cases,particularly for any projective parameterized code associated to the incidencematrix of uniform clutters and then they work in the case of graphs.

Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters