Formula for the number of [9,3] MDS codes

DOI10.1109/18.476239zbMath0856.94024OpenAlexW2153513953WikidataQ57395861 ScholiaQ57395861MaRDI QIDQ4880291

Alexei N. Skrobogatov, E. A. Sorokin, Anna V. Iampolskaia

Publication date: 13 August 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.476239

zbMATH Keywords

projective planesfinite fieldslinear MDS codesnumber of \(n\)-arcs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22)

Related Items (7)

An algorithm for counting arcs in higher-dimensional projective space ⋮ Arcs in \(\mathbb{F}_q^2\) ⋮ Counting arcs in projective planes via Glynn's algorithm ⋮ Counting generalized Reed-Solomon codes ⋮ Likelihood degenerations ⋮ On the cohomology of the space of seven points in general linear position ⋮ Hyperplane sections of Grassmannians and the number of MDS linear codes

This page was built for publication: Formula for the number of [9,3] MDS codes