Enumerative Coding for Line Polar Grassmannians

نویسندگان

  • Ilaria Cardinali
  • Luca Giuzzi
چکیده

Codes arising from Grassmannians have been widely investigated, both as generalization of Reed–Muller codes and for applications to network coding. Recently we introduced some new codes, arising from Polar Grassmannians, namely the set of all subspaces of a vector space F q which are totally singular with respect to a given non-degenerate quadratic form. The aim of the present paper is to present an efficient enumerative coding and decoding strategy for line polar Grassmann codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerative coding for line polar Grassmannians with applications to codes

A k-polar Grassmannian is the geometry having as pointset the set of all k-dimensional subspaces of a vector space V which are totally isotropic for a given non-degenerate bilinear form μ defined on V. Hence it can be regarded as a subgeometry of the ordinary k-Grassmannian. In this paper we deal with orthogonal line Grassmannians and with symplectic line Grassmannians, i.e. we assume k = 2 and...

متن کامل

Polar Grassmannians and their Codes

We present a concise description of Orthogonal Polar Grassmann Codes and motivate their relevance. We also describe efficient encoding and decoding algorithms for the case of Line Grassmannians and introduce some open problems.

متن کامل

About enumerative algebraic geometry in TGD framework

String models and M-theory involve both algebraic and symplectic enumerative geometry. Also in adelic TGD enumerative algebraic geometry emerges. This article gives a brief summary about the basic ideas involved and suggests some applications to TGD. 1. One might want to know the number of points of sub-variety belonging to the number field defining the coefficients of the polynomials. This pro...

متن کامل

On hyperovals of polar Grassmannians

A hyperoval of a point-line geometry is a nonempty set of points meeting each line in either 0 or 2 points. In this paper, we study hyperovals in line Grassmannians of finite polar spaces of rank 3, hereby often imposing some extra regularity conditions. We determine an upper bound and two lower bounds for the size of such a hyperoval. If equality occurs in one of these bounds, then there is an...

متن کامل

Characterization of apartments in polar Grassmannians

Buildings of types Cn and Dn are defined by rank n polar spaces. The associated building Grassmannians are polar and half-spin Grassmannians. Apartments in dual polar spaces and half-spin Grassmannians were characterized in [4]. We characterize apartments in all polar Grassmannians consisting of non-maximal singular subspaces. This characterization is a partial case of more general results conc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1412.5466  شماره 

صفحات  -

تاریخ انتشار 2014