ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A matrix characterization of Near-MDS codes

Viswanath, G and Rajan, BS (2006) A matrix characterization of Near-MDS codes. In: Ars Combinatoria, 79 . pp. 289-294.

Full text not available from this repository. (Request a copy)

Abstract

It is well known that a linear code over a finite field with the systematic generator matrix [I/P] is MDS (Maximum Distance Separable) if and only if every square submatrix of P is nonsingular. In this correspondence we obtain a similar characterization for the class of Near-MDS codes in terms of the submatrices of P.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to The Charles Babbage Research Centre.
Keywords: Generalized Hamming Weights;Linear Codes
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 31 May 2006
Last Modified: 27 Aug 2008 12:05
URI: http://eprints.iisc.ernet.in/id/eprint/7161

Actions (login required)

View Item View Item