Decoding Binary Linear Block Codes Using Local Search

This paper presents a novel iterative hard decision decoding algorithm for binary linear block codes over a binary symmetric channel (BSC). The problem is formulated as a 0-1 integer programming problem which is known to be NP-hard. When the crossover probability c of the channel is known, the solut...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 61; no. 6; pp. 2138 - 2145
Main Authors:	Esmaeili, M., Alampour, A., Gulliver, T. A.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.06.2013 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Applied sciences Coding, codes Exact sciences and technology Indexes Information, signal and communications theory Integer programming Integer programming decoding Iterative decoding Linear programming Maximum likelihood decoding maximum likelihood hard decision decoding multi-flip local search decoding Search problems Signal and communications theory Studies Telecommunications and information theory Performance evaluation Block code Binary channel multi-flip local search decoding Probabilistic approach Cross-over phenomenon Code distance Iterative method Binary code Iterative decoding Penalty method Search algorithm Integer programming Linear code Penalty function Credal approach NP hard problem maximum likelihood hard decision decoding Numerical simulation Minimal distance Maximum likelihood Integer programming decoding
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!