Enumerative coding for line polar Grassmannians with applications to codes

DOI10.1016/j.ffa.2017.03.005zbMath1375.14164arXiv1412.5466OpenAlexW2404884661MaRDI QIDQ2363322

Ilaria Cardinali, Luca Giuzzi

Publication date: 13 July 2017

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

Full work available at URL: https://arxiv.org/abs/1412.5466

zbMATH Keywords

linear codessymplectic GrassmannianOrthogonal Grassmannian

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Grassmannians, Schubert varieties, flag manifolds (14M15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (4)

Minimum distance of symplectic Grassmann codes ⋮ Line Hermitian Grassmann codes and their parameters ⋮ Minimum distance of orthogonal line-Grassmann codes in even characteristic ⋮ Implementing line-Hermitian Grassmann codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum distance of symplectic Grassmann codes
• Line polar Grassmann codes of orthogonal type
• The minimum weight of the Grassmann codes C(k,n)
• Locally decodable codes and private information retrieval schemes.
• Some subspaces of the \(k\)th exterior power of a symplectic vector space
• Hyperplane sections of Grassmannians and the number of MDS linear codes
• Minimum distance of orthogonal line-Grassmann codes in even characteristic
• Grassmann and Weyl embeddings of orthogonal Grassmannians
• Automorphism groups of Grassmann codes
• Codes and caps from orthogonal Grassmannians
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• Embeddings of Line-Grassmannians of Polar Spaces in Grassmann Varieties
• Weight Spectrum of Codes Associated With the Grassmannian <formula formulatype="inline"><tex Notation="TeX">$G(3,7)$</tex></formula>
• Locally Decodable Codes: A Brief Survey
• On the efficiency of local decoding procedures for error-correcting codes
• Coding for Errors and Erasures in Random Network Coding
• The weyl modules and the irreducible representations of the symplectic group with the fundamental highest weights
• Duals of Affine Grassmann Codes and Their Relatives
• Enumerative Coding for Grassmannian Space
• Enumerative source encoding

This page was built for publication: Enumerative coding for line polar Grassmannians with applications to codes