By Topic

Linear programming-based optimization of the distance spectrum of linear block 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)
Ferrari, G. ; Dipt. di Ingegneria dell''Informazione, Univ. di Parma, Italy ; Chugg, K.M.

We describe an approach for the identification of good distance spectra for possibly existing binary linear block codes based on linear programming and the MacWilliams-Delsarte (1977, 1972) identities. Specifically, the linear program is defined by an expression characterizing the performance of a potential code in terms of its distance spectrum and constraints imposed by the MacWilliams-Delsarte identities. Using the union bound to characterize performance, our results suggest that the best distance spectrum is not a function of signal-to-noise ratio (SNR) above the cutoff rate SNR and also suggest the existence of several unknown, good codes. Characterizing the performance using the maximum spectral error component of the union bound suggests spectral thinning with decreasing SNR.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 7 )