DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/100/1819

Title: Subclose families, threshold graphs, and the weight hierarchy of Grassmann and Schubert Codes
Authors: GHORPADE, SR
PATIL, AR
PILLAI, HK
Keywords: linear codes
varieties
squares
sum
Issue Date: 2009
Publisher: AMER MATHEMATICAL SOC
Citation: ARITHMETIC, GEOMETRY, CRYPTOGRAPHY AND CODING THEORY,487,87-99
Abstract: We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and. more generally, to Schubert varieties in Grassmannians. In geometric terms, this corresponds to the determination of the maximum number of F.-rational points on sections of Schubert varieties (with nondegenerate Plucker embedding) by linear subvarieties of a fixed (co)dimension. The problem is partially solved in the case of Grassmann codes, and one of the solutions uses the combinatorial notion of a close family. We propose a generalization of this to what is called a subclose family. A number of properties of subclose families are proved, and its connection with the notion of threshold graphs and graphs with maximum sum of squares of vertex degrees is outlined.
URI: http://dspace.library.iitb.ac.in/xmlui/handle/10054/15068
http://hdl.handle.net/100/1819
ISBN: 978-0-8218-4716-9
ISSN: 0271-4132
Appears in Collections:Proceedings papers

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback