By Topic

New lower bounds for constant weight 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

2 Author(s)
van Pul, C.L.M. ; Philips USFA, Eindhoven, Netherlands ; Etzion, T.

Some new lower bounds are given for A(n,4,w ), the maximum number of codewords in a binary code of length n , minimum distance 4, and constant weight w. In a number of cases the results significantly improve on the best bounds previously known

Published in:

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