Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Maruta, Tatsuya
and
Kaneta, Hitoshi
1991.
On the uniqueness of (q + 1)-arcs of PG (5, q), q = 2h, h ≥ 4.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 110,
Issue. 1,
p.
91.
Storme, Leo
and
Szőnyi, Tamás
1994.
Intersection of arcs and normal rational curves in spaces of even characteristic.
Journal of Geometry,
Vol. 51,
Issue. 1-2,
p.
150.
Dür, Arne
1994.
On the covering radius of Reed—Solomon codes.
Discrete Mathematics,
Vol. 126,
Issue. 1-3,
p.
99.
Ali, A.H.
Hirschfeld, J.W.P.
and
Kaneta, H.
1995.
On the size of arcs in projective spaces.
IEEE Transactions on Information Theory,
Vol. 41,
Issue. 6,
p.
1649.
Hirschfeld, J. W. P.
1995.
Cryptography and Coding.
Vol. 1025,
Issue. ,
p.
44.
Hirschfeld, J.W.P.
and
Storme, L.
1998.
The packing problem in statistics, coding theory and finite projective spaces.
Journal of Statistical Planning and Inference,
Vol. 72,
Issue. 1-2,
p.
355.
Shokrollahi, M. Amin
2000.
Coding Theory and Cryptography.
p.
202.
Hirschfeld, J. W. P.
and
Storme, L.
2001.
Finite Geometries.
Vol. 3,
Issue. ,
p.
201.
Kéri, Gerzson
2006.
Types of superregular matrices and the number ofn‐arcs and completen‐arcs in PG (r, q).
Journal of Combinatorial Designs,
Vol. 14,
Issue. 5,
p.
363.
Hirschfeld, J.W.P.
and
Thas, J.A.
2015.
Open problems in finite projective spaces.
Finite Fields and Their Applications,
Vol. 32,
Issue. ,
p.
44.
Ball, Simeon
and
Lavrauw, Michel
2018.
Planar arcs.
Journal of Combinatorial Theory, Series A,
Vol. 160,
Issue. ,
p.
261.
Zhang, Jun
Wan, Daqing
and
Kaipa, Krishna
2020.
Deep Holes of Projective Reed-Solomon Codes.
IEEE Transactions on Information Theory,
Vol. 66,
Issue. 4,
p.
2392.
Durante, N.
Longobardi, G.
and
Pepe, V.
2023.
$$(d,\varvec{\sigma })$$-Veronese variety and some applications.
Designs, Codes and Cryptography,
Vol. 91,
Issue. 5,
p.
1911.
Han, Dongchun
and
Ren, Yuan
2023.
A Tight Upper Bound for the Maximal Length of MDS Elliptic Codes.
IEEE Transactions on Information Theory,
Vol. 69,
Issue. 2,
p.
819.