{'fraction_non_alphanumeric': 0.02844311377245509, 'fraction_numerical': 0.016467065868263474, 'mean_word_length': 4.920353982300885, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Suboptimal SISO decoding of systematic binary algebraic block codes

In a previous paper (see Proc. IEEE GLOBECOM Conference, vol.2, p.842-6, Nov. 2000) we applied the MAP-SPC decoding technique to the decoding of short Hamming codes. In this paper, further results are presented for longer Hamming codes. This technique achieves performance gains of approximately 1 dB and 7 dB over hard algebraic decoding in the AWGN and fading channel respectively. Although this decoding strategy is suboptimal compared to ML soft decision decoding, its complexity is relatively low and grows linearly with increasing block length. In addition, the decoder is simple to implement.