By Topic

A characterization of codes with extreme parameters

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)
Faldum, A. ; Fakultat fur Math., Otto-von-Guericke-Univ., Magdeburg, Germany ; Willems, W.

Let C be an [n,k,d]-code over GP(q) with k⩾2. Let s=def(C)=n+1-k-d denote the defect of C. The Griesmer bound implies that d⩽q(s+1). If d>qs and s⩾2, then using a previous result of Faldum and Willems, k⩽q. Thus fixing s⩾2 the extreme parameters for a code with def(C)=s are d=q(s+1); k=q, and n=k+d+s-1=(q+1)(s+2)-3. In this correspondence we characterize the codes with such parameters

Published in:

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