By Topic

Algebraic characterization of MDS group codes over cyclic groups

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zain, A.A. ; Dept. of Electr. Eng., Indian Inst. of Technol., Delhi, India ; Rajan, B.S.

An (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 code

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 6 )