Abstract—In this paper, we investigate the performancecomplexity trade-off for two leading-edge channel coding techniques, namely Duo-Binary Turbo-Codes (DBTC) and Block LDPC Codes (BLDPCC). We assess their respective decoding complexity in terms power consumption and cycle delays, as a function of both the code rate and packet length, to derive a domain of suitability for both techniques. We also compare their capabilities to serve as mother codes for Rate-Compatible Punctured Codes (RCPC) and finally analyze their achievable throughput, as a function of the degree of parallelism.