2000 character limit reached
Improved Two-Point Codes on Hermitian Curves
Published 10 Apr 2010 in cs.IT, math.AG, math.IT, and math.NT | (1004.1752v2)
Abstract: One-point codes on the Hermitian curve produce long codes with excellent parameters. Feng and Rao introduced a modified construction that improves the parameters while still using one-point divisors. A separate improvement of the parameters was introduced by Matthews considering the classical construction but with two-point divisors. Those two approaches are combined to describe an elementary construction of two-point improved codes. Upon analysis of their minimum distance and redundancy, it is observed that they improve on the previous constructions for a large range of designed distances.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.