2000 character limit reached
Codes and caps from orthogonal Grassmannians
Published 22 Mar 2013 in math.AG, cs.IT, math.CO, and math.IT | (1303.5636v2)
Abstract: In this paper we investigate linear error correcting codes and projective caps related to the Grassmann embedding $\varepsilon_k{gr}$ of an orthogonal Grassmannian $\Delta_k$. In particular, we determine some of the parameters of the codes arising from the projective system determined by $\varepsilon_k{gr}(\Delta_k)$. We also study special sets of points of $\Delta_k$ which are met by any line of $\Delta_k$ in at most 2 points and we show that their image under the Grassmann embedding $\varepsilon_k{gr}$ is a projective cap.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.