Maximum distance separable codes and arcs in projective spaces
From MaRDI portal
Publication:2642024
DOI10.1016/j.jcta.2006.11.005zbMath1126.94017arXivmath/0507604OpenAlexW1968759207MaRDI QIDQ2642024
Publication date: 20 August 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0507604
Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25) Finite partial geometries (general), nets, partial spreads (51E14)
Related Items (11)
ON SOME CLASSES OF FUNCTIONS AND HYPERCUBES ⋮ A characterization of MDS codes that have an error correcting pair ⋮ Further results on the classification of MDS codes ⋮ Maximal AMDS codes ⋮ Cubic curves, finite geometry and cryptography ⋮ Codes from strongly regular \(( \alpha , \beta )\)-reguli ⋮ On maximum Lee distance codes ⋮ Note on maximal distance separable codes ⋮ Euclidean and Hermitian LCD MDS codes ⋮ Coprimitive sets and inextendable codes ⋮ On the maximality of linear codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Curve razionali normali e \(k\)-archi negli spazi finiti
- Nuclei of sets of \(q+1\) points in PG(2,q) and blocking sets of Redei type
- Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre - some extensions
- Complete arcs and algebraic curves in \(\text{PG}(2,q)\)
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- On extendable planes, M.D.S. codes and hyperovals in PG(2,q), \(q=2^ t\)
- Finite geometries, varieties and codes
- Collineations and extensions of translation nets
- On the number of slopes of the graph of a function defined on a finite field
- The number of directions determined by a function over a finite field.
- Around Rédei's theorem
- A vector-space packing problem
- Extending MDS codes
- A Metrization for Power-Sets with Applications to Combinatorial Analysis
- A Theorem on Permutations of a Finite Field
This page was built for publication: Maximum distance separable codes and arcs in projective spaces