On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed–Solomon Codes
- 作者: Bartoli D.1, Davydov A.A.2, Marcugini S.1, Pambianco F.1
-
隶属关系:
- Department of Mathematics and Computer Sciences
- Kharkevich Institute for Information Transmission Problems
- 期: 卷 54, 编号 2 (2018)
- 页面: 101-115
- 栏目: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166496
- DOI: https://doi.org/10.1134/S0032946018020011
- ID: 166496
如何引用文章
详细
Abstract—In the projective plane PG(2, q), a subset S of a conic C is said to be almost complete if it can be extended to a larger arc in PG(2, q) only by the points of C \ S and by the nucleus of C when q is even. We obtain new upper bounds on the smallest size t(q) of an almost complete subset of a conic, in particular,
作者简介
D. Bartoli
Department of Mathematics and Computer Sciences
编辑信件的主要联系方式.
Email: daniele.bartoli@unipg.it
意大利, Perugia
A. Davydov
Kharkevich Institute for Information Transmission Problems
Email: daniele.bartoli@unipg.it
俄罗斯联邦, Moscow
S. Marcugini
Department of Mathematics and Computer Sciences
Email: daniele.bartoli@unipg.it
意大利, Perugia
F. Pambianco
Department of Mathematics and Computer Sciences
Email: daniele.bartoli@unipg.it
意大利, Perugia
补充文件
