Linear programming-based optimization of the distance spectrum of linear block codes

DOI10.1109/TIT.2003.813483MaRDI QIDQ3546876zbMATH OpenOpenAlexFDO

Authors Keith M. Chugg, Gian Luigi Ferrari

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2003.813483

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Linear codes (general theory) (94B05)

Recommendations

• A New Linear Programming Approach to Decoding Linear Block Codes
• Spectral approach to linear programming bounds on codes
• scientific article; zbMATH DE number 3543912
• Numerical results on the asymptotic rate of binary codes
• Using Linear Programming to Decode Binary Linear Codes

Cited in

(2)

• Linear Subcodes of Turbo Codes With Improved Distance Spectra
• Rate amplification and query-efficient distance amplification for linear LCC and LDC

This page was built for publication: Linear programming-based optimization of the distance spectrum of linear block codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546876)