Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On algebras admitting a complete set of near weights, evaluation codes and Goppa codes (0807.3198v1)

Published 21 Jul 2008 in cs.IT and math.IT

Abstract: In 1998 Hoholdt, van Lint and Pellikaan introduced the concept of a weight function'' defined on a F_q-algebra and used it to construct linear codes, obtaining among them the algebraic-geometric (AG) codes supported on one point. Later it was proved by Matsumoto that all codes produced using a weight function are actually AG codes supported on one point. Recently,near weight functions'' (a generalization of weight functions), also defined on a F_q-algebra, were introduced to study codes supported on two points. In this paper we show that an algebra admits a set of m near weight functions having a compatibility property, namely, the set is a ``complete set'', if and only if it is the ring of regular functions of an affine geometrically irreducible algebraic curve defined over F_q whose points at infinity have a total of m rational branches. Then the codes produced using the near weight functions are exactly the AG codes supported on m points. A formula for the minimum distance of these codes is presented with examples which show that in some situations it compares better than the usual Goppa bound.

Citations (5)

Summary

We haven't generated a summary for this paper yet.