DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Energy Studies [CES] >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1639

Full metadata record

DC FieldValueLanguage
dc.contributor.authorZain, A A-
dc.contributor.authorRajan, B S-
dc.date.accessioned2006-05-09T06:35:53Z-
dc.date.available2006-05-09T06:35:53Z-
dc.date.issued1995-
dc.identifier.citationInformation Theory, IEEE International Symposium on, 495en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/1639-
dc.description.abstractReed-Solomon codes over GF(pm), p a prime and m a positive integer, are cyclic maximum distance separable (MDS) and of length pm-1. The additive group of GF(pm) is elementary abelian of type (1,1,...,1), isomorphic to a direct product of m cyclic groups of order p, denoted by Cpm. This paper deals with MDS codes over Cpm of length pm-1 which are cyclic and MDS, called Reed-Solomon group codes. In general, a group code over Cpm need not be a linear code over GF(pm) as shown by an exampleen
dc.format.extent13930 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectreed-solomon codesen
dc.subjectlinear codeen
dc.titleReed-Solomon group codesen
dc.typeArticleen
Appears in Collections:Energy Studies [CES]

Files in This Item:

File Description SizeFormat
zainree1995.pdf13.6 kBAdobe PDFView/Open
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