The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes

Tsai, C. Y. (2014). QC-LDPC Code Construction by Proto-Matrix Extension Based on Depth Tree [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-3103201511193419
Chen, C. C. (2019). Designs for Efficient Tree-Search Decoding Algorithms [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201903338
Gao, J., Cheng, R., Chen, Y. X., & Jiang, C. (2021). 2D Phase Unwrapping Method Based on Minimum Balanced Trees of Dual Residues. 電腦學刊, 32(1), 11-26. https://doi.org/10.3966/199115992021023201002
Mike, N. (2015). Structured Data: Tree constructing and programming dynamics. IRA-International Journal of Technology & Engineering, 1(1), 7-11. https://www.airitilibrary.com/Article/Detail?DocID=P20160719004-201511-201607300045-201607300045-7-11
Chen, S. (2000). Regression Trees with Genetic Programming [master's thesis, Yuan Ze University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611313174