By Topic

More results on the weight enumerator of product codes

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

1 Author(s)
Tolhuizen, L.M.G.M. ; Philips Res. Lab., Eindhoven, Netherlands

We consider the product code Cp of q-ary linear codes with minimum distances dc and dr. The words in Cp of weight less than drdc+max(dr(dc/g),dc(dr/q)) are characterized, and their number is expressed in the number of low-weight words of the constituent codes. For binary product codes, we give an upper bound on the number of words in Cp of weightless than min(dr(dc+(dc/2)+1)), dc(dr+(dr/2)+1) that is met with equality if Cc and Cr are (extended) perfect codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 9 )