Cart (Loading....) | Create Account
Close category search window

Semidefinite Code Bounds Based on Quadruple Distances

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

3 Author(s)
Gijswijt, D.C. ; CWI, Amsterdam, Netherlands ; Mittelmann, H.D. ; Schrijver, A.

Let A(n,d) be the maximum number of 0, 1 words of length n , any two having Hamming distance at least d. It is proved that A(20,8)=256, which implies that the quadruply shortened Golay code is optimal. Moreover, it is shown that A(18,6) ≤ 673, A(19,6) ≤ 1237, A(20,6) ≤ 2279, A(23,6) ≤ 13674, A(19,8) ≤ 135, A(25,8) ≤ 5421, A(26,8) ≤ 9275, A(27,8) ≤ 17099, A(21,10) ≤ 47, A(22,10) ≤ 84, A(24,10) ≤ 268, A(25,10) ≤ 466, A(26,10) ≤ 836, A(27,10) ≤ 1585, A(28,10) ≤ 2817, A(25,12) ≤ 55, and A(26,12) ≤ 96. The method is based on the positive semidefiniteness of matrices derived from quadruples of words. This can be put as constraint in a semidefinite program, whose optimum value is an upper bound for A(n,d). The order of the matrices involved is huge. However, the semidefinite program is highly symmetric, by which its feasible region can be restricted to the algebra of matrices invariant under this symmetry. By block diagonalizing this algebra, the order of the matrices will be reduced so as to make the program solvable with semidefinite programming software in the above range of values of n and d.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 5 )

Date of Publication:

May 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.