Open AccessMultiple‐rate codes from block Markov superposition transmission of first‐order Reed–Muller and extended Hamming codes
Author(s) -
Tong Sheng,
Liu Bo,
Guo Qinghua,
Tong Jun,
Xi Jiangtao
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2016.1972
Subject(s) - hamming code , block code , linear code , luby transform code , mathematics , algorithm , reed–muller code , fountain code , concatenated error correction code , markov chain , decoding methods , computer science , statistics
Block Markov superposition transmission (BMST) of first‐order Reed–Muller and extended Hamming (RMEH) codes is investigated. Multiple code rates can be easily realised by adjusting the mixture ratio of Reed–Muller and extended Hamming codes. Compared with the original BMST of repetition and single‐parity‐check (RSPC) codes, the proposed BMST‐RMEH codes can perform close to Shannon limits over a wide range of code rates with about only half the encoding memories of BMST‐RSPC codes. As a result of the reduction of encoding memories, the decoding complexity and delay of BMST‐RMEH codes are approximately half (or even lower than) those of BMST‐RSPC codes.