Computing the minimum distance of the C( O₃ , 6) polar orthogonal Grassmann code with elementary methods

DOI10.1016/J.FFA.2025.102656MaRDI QIDQ6965874zbMATH OpenFDO

Authors Sarah Gregory, Fernando Piñero-González, Doel Rivera Laboy, Lani Southern

Publication date 30 June 2025

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2025.102656

zbMATH Keywords

dual polar spacesGrassmann embeddingminimum distanceorthogonal Grassmannian

Mathematics Subject Classification ID

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

Cites work

• Affine Grassmann Codes
• General Galois Geometries
• Grassmann embeddings of polar Grassmannians
• scientific article; zbMATH DE number 4041793 (Why is no real title available?)
• scientific article; zbMATH DE number 4041794 (Why is no real title available?)
• scientific article; zbMATH DE number 1009714 (Why is no real title available?)
• Implementing line-Hermitian Grassmann codes
• Line Hermitian Grassmann codes and their parameters
• Line polar Grassmann codes of orthogonal type
• Minimum distance of orthogonal line-Grassmann codes in even characteristic
• Minimum distance of symplectic Grassmann codes
• New generalizations of the Reed-Muller codes--I: Primitive codes
• On the geometry of algebraic homogeneous spaces
• The generating rank of the unitary and symplectic Grassmannians

This page was built for publication: Computing the minimum distance of the \(C( \mathbb{O}_{3 , 6})\) polar orthogonal Grassmann code with elementary methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965874)