EPrints@IIT Delhi >
Faculty Research Publicatons  >
Electrical Engineering >

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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorZain, A A-
dc.contributor.authorRajan, B S-
dc.identifier.citationInformation Theory, IEEE Transactions on, 41(6), 2052 - 2056p.en
dc.description.abstractAn (n,k) group code over a group G is a subset of Gn which forms a group under componentwise group operation and can be defined in terms of n-k homomorphisms from Gk to G. The set of homomorphisms which define maximum distance separable (MDS) group codes defined over cyclic groups are characterized. Each defining homomorphism can be specified by a set of k endomorphisms of G. A matrix is associated with the k(n-k) defining endomorphisms of the code and necessary and sufficient conditions for this matrix to define an MDS code over cyclic groups is proved. Using this matrix characterization it is proved that over a cyclic group with M elements, where M=p1d(1)p2d(2) ···pmd(m),(k+s,k) MDS group codes, for all s,k⩾2, do not exist if max {s,k}⩾min {p1,p2,··,pm}. Finally, it is shown that the dual code of an MDS group code over CM, a cyclic group with M elements, is also an MDS group codeen
dc.format.extent76529 bytes-
dc.subjectgroup codesen
dc.subjectMDS codesen
dc.subjectdual codesen
dc.subjectcyclic groupsen
dc.titleAlgebraic characterization of MDS group codes over cyclic groupsen
Appears in Collections:Electrical Engineering

Files in This Item:

File Description SizeFormat
zainalg1995.pdf74.74 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