Fast algorithms for decoding orthogonal and related codes

Recursive constructions and their maximum likelihood decoding

“…Each decoding retrieves a new subset of information symbols associated with the current end node. In both cases, maximum likelihood decoding has complexity order at most n log 2 n [4]. Simple analysis also shows that recalculating all posterior probabilities in ( 4) and ( 5) has complexity at most 5n.…”