By Topic

Suboptimal SISO decoding of systematic binary algebraic 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
$33 $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)
J. S. K. Tee ; Commun. Res. Group, Univ. of Canterbury, Christchurch, New Zealand ; D. P. Taylor

Previous work on concatenated single parity-check codes has yielded exceptionally good performance despite, or perhaps because of, their weak algebraic structure. In this article, maximum a posteriori single parity-check decoders are applied to the decoding of systematic binary algebraic block codes. Results for a range of Hamming codes show good performance compared to soft-decision brute force (maximum-likelihood) and algebraic decoding. The decoding complexity of the proposed technique grows only linearly with increasing block length.

Published in:

IEEE Transactions on Communications  (Volume:51 ,  Issue: 5 )