Abstract
We obtain descriptions of the Lagrangian–Grassmannian code (Carrillo-Pacheco and Zaldivar in Des Codes Cryptogr 60:291–268, 2011) as a linear code associated with an FFN(1, q)-projective variety (Carrillo-Pacheco and Zaldivar in Adv Math Commun 10:209–220, 2016), and using these descriptions, we obtain bounds for its higher weights.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
