By Topic

Classification of Binary 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
$33 $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)
Patric R. J. Ostergard ; Department of Communications and Networking, Aalto University, Aalto, Finland

A binary code C ⊆ F2n with minimum distance at least d and codewords of Hamming weight w is called an (n,d,w) constant weight code. The maximum size of an (n,d,w) constant weight code is denoted by A(n,d,w), and codes of this size are said to be optimal. In a computer-aided approach, optimal (n,d,w) constant weight codes are here classified up to equivalence for d=4, n ≤ 12; d=6, n ≤ 14; d=8, n ≤ 17; d=10, n ≤ 20 (with one exception); d=12, n ≤ 23; d=14, n ≤ 26; d=16, n ≤ 28; and d=18, n ≤ 28. Moreover, several new upper bounds on A(n,d,w) are obtained, leading among other things to the exact values A(12,4,5)=80, A(15,6,7)=69, A(18,8,7)=33, A(19,8,7)=52, A(19,8,8)=78, and A(20,8,8)=130 . Since A(15,6,6)=70, this gives the first known example of parameters for which A(n,d,w-1) > A(n,d,w) with wn/2. A scheme based on double counting is developed for validating the classification results.

Published in:

IEEE Transactions on Information Theory  (Volume:56 ,  Issue: 8 )