Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

In an earlier paper we developed a unified approach to the extendability problem for arcs in PG(k - 1, q) and, equivalently, for linear codes over finite fields. We defined a special class of arcs called (t mod q)-arcs and proved that the extendabilty of a given arc depends on the structure of a special dual arc, which turns out to be a (t mod q)-arc. In this paper, we investigate the general structure of (t mod q)-arcs. We prove that every such arc is a sum of complements of hyperplanes. Furthermore, we characterize such arcs for small values of t, which in the case t = 2 gives us an alternative proof of the theorem by Maruta on the extendability of codes. This result is geometrically equivalent to the statement that every 2-quasidivisible arc in PG(k - 1, q), q ≥ 5, q odd, is extendable. Finally, we present an application of our approach to the extendability problem for caps in PG(3, q).

作者简介

I. Landjev

New Bulgarian University; Institute of Mathematics and Informatics

编辑信件的主要联系方式.
Email: i.landjev@nbu.bg
保加利亚, Sofia; Sofia

A. Rousseva

Faculty of Mathematics and Informatics

Email: i.landjev@nbu.bg
保加利亚, Sofia

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2019