In this paper we studyq-ary codes arising from modular curvesX₀(11l)over GF(p²)and some binary codes attached to them. All these codes have a polynomial construction and have "good" asymptotic parameters: for certain values of the parameters theq-ary codes withq = p² ≥ 49are better than the Varshamov-Gilbert bound, and the binary codes are better than the Ziablov bounds.
No takes yet. Share an insight, caveat, or question.
Katsman et al. (1984) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: