Abstract
In this letter, a new class of low-rate error-correcting codes named parallel concatenated tree Hadamard codes (CTrHC) are designed. Tree Hadamard codes consist of Hadamard segments which are connected by carefully chosen positions from a Hadamard codeword. With the same encoding and decoding complexity as the parallel concatenated zigzag Hadamard codes, CTrHC with short code length can achieve much better error floor performance illustrated by simulation results.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
