By Topic

Some new 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

1 Author(s)
Koschnick, K.-U. ; Fakultat fuer Math., Bielefeld Univ., West Germany

A(n,d, w) denotes the maximum cardinality of any binary code of length n, minimum distance d, and constant weight w. The results of a search for good constant weight codes using a combinatorial optimization algorithm are reported. A brief description of the algorithm is given. The problem of constructing a constant weight code of length n, minimum distance d, and weight w containing M codewords is mapped to an optimization problem. The algorithm is used to solve the optimization problem for given parameters n, d,w, and M. The application of the algorithm has led to some new constant weight codes. Their parameters are given

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 2 )