Improving the performance of LP decoders for cyclic codes

Authors:
M. R. Heidarpour;M. Modarres-Hashemi;M. Khosravifard;T. A. Gulliver
Affiliations:
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran;Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran;Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran;Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 5
Cited 0

Error control systems for digital communication and storage

Error control systems for digital communication and storage
Decoding error-correcting codes via linear programming

Decoding error-correcting codes via linear programming
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory
A New Linear Programming Approach to Decoding Linear Block Codes

IEEE Transactions on Information Theory
Nonlinear programming approaches to decoding low-density parity-check codes

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a linear programming (LP) decoder has been introduced for binary linear codes. Although the performance of an LP decoder has a close relationship with the form of the parity check matrix (or equivalently with the Tanner graph) of the code, there is no clear approach to choosing a suitable form for LP decoding. In this paper, we focus on the class of cyclic codes, and show that the cyclic structure of the code can be used to expand the parity check matrix and obtain a low redundancy form which is suitable for LP decoding. Performance results are given which demonstrate the effectiveness of the proposed algorithm.