On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes

DOI10.1134/S0032946018020011zbMath1411.94109OpenAlexW2964035831MaRDI QIDQ2314145

Stefano Marcugini, Fernanda Pambianco, Daniele Bartoli, Alexander A. Davydov

Publication date: 19 July 2019

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946018020011

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Blocking sets, ovals, (k)-arcs (51E21)

Related Items

On the weight distribution of the cosets of MDS codes

Uses Software

• Magma

Cites Work

• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Inclusion matrices and the MDS conjecture
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Complete \(k\)-arcs in PG(\(n,q\)), \(q\) even
• Completeness of normal rational curves
• \(k\)-arcs and dual \(k\)-arcs
• Space-filling subsets of a normal rational curve
• The Magma algebra system. I: The user language
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• Open problems in finite projective spaces
• Applications of finite geometry in coding theory and cryptography
• Finite Geometry and Combinatorial Applications
• On Subsets of the Normal Rational Curve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item