By Topic

A characterization of certain Griesmer codes: MMD codes in a more general sense

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)
Olsson, J. ; Dept. of Electr. Eng., Linkoping Univ., Sweden ; Willems, W.

Let C be an [n,k,d]q linear code. The defect of C is the parameter s=s(C)=n-k+1-d. If k⩾m+1⩾2 then by the Griesmer bound d⩽(qm(q-1)/qm-1)(s+m). The author's interest is in those linear codes having the maximum minimum distance, i.e., d=(qm(q-1)/qm-1)(s+m). For m=1 we have d=q(s+1) and the codes are maximum minimum distance (MMD) codes in the sense of Faldum and Willems (see ibid., vol.44, p.1555-58, 1998). Thus we consider MMD codes in a more general sense. We refer to them simply as MMD codes. All MMD codes with m=1 are known up to formal equivalence. Note that two codes are formally equivalent if they have the same weight distribution. The author classifies up to formal equivalence the MMD codes with m⩾2

Published in:

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