Schubert varieties, linear codes and enumerative combinatorics.

DOI10.1016/J.FFA.2004.09.002MaRDI QIDQ955201zbMATH OpenOpenAlexFDO

Authors Mikhail Anatolievich Tsfasman, Sudhir R. Ghorpade

Publication date 19 November 2008

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

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

Grassmannian Linear codes Minimum distance Projective system Schubert variety

Asymptotic enumeration (05A16) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Grassmannians, Schubert varieties, flag manifolds (14M15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry. This is illustrated by codes associated to Schubert varieties in Grassmannians, called Schubert codes, which have recently been studied. The basic parameters such as the length, dimension and minimum distance of these codes are known only in special cases. An upper bound for the minimum distance is known and it is conjectured that this bound is achieved. We give explicit formulae for the length and dimension of arbitrary Schubert codes and prove the minimum distance conjecture in the affirmative for codes associated to Schubert divisors.

Recommendations

Cites work

Cited in

(22)

This page was built for publication: Schubert varieties, linear codes and enumerative combinatorics.

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