An \(n\)-arc \(K\) in the projective space \(PG(r,q)\), \(n\geq r+1\), is a set of \(n\) points such that no \(r+1\) of them lie on a hyperplane and, \(K\) is complete if it is maximal with respect to set-theoretic inclusion. A cyclic arc, or, equivalently, a pseudo-cyclic MDS code, is an arc admitting a cyclic collineation group. In the paper under review, known results on the existence of cyclic arcs are surveyed. Also, the author proves some results on the completeness of cyclic \(n\)-arcs of \(PG(2,q)\) in the cases \(n=8t\), \(q\equiv 4t-1\)mod (\(n\)), and \(n| q^2+q+1\), \(n<q-1\).
- Classification of pseudo-cyclic MDS codes
- Cyclic arcs in \(\mathrm{PG}(2,q)\)
- scientific article; zbMATH DE number 3845495 (Why is no real title available?)
- scientific article; zbMATH DE number 3891252 (Why is no real title available?)
- scientific article; zbMATH DE number 4211965 (Why is no real title available?)
- scientific article; zbMATH DE number 3917102 (Why is no real title available?)
- scientific article; zbMATH DE number 3947043 (Why is no real title available?)
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3760078 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 492660 (Why is no real title available?)
- scientific article; zbMATH DE number 890855 (Why is no real title available?)
- Maximum distance separable multilevel codes (Corresp.)
- New 5-designs
- On the existence of cyclic and pseudo-cyclic MDS codes
- Pseudocyclic maximum-distance-separable codes
- Unital intersections in finite projective planes
This page was built for publication: Cyclic arcs and pseudo-cyclic MDS codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377795)