[1]
|
B. Amiri, C.-W. Lin and L. Dolecek, Asymptotic distribution of absorbing sets and fully absorbing sets for regular sparse code ensembles, IEEE Transactions on Communications, 61 (2013), 455-464.
doi: 10.1109/TCOMM.2012.120512.110605.
|
[2]
|
J. Bae, A. Abotabl, H.-P. Lin, K.-B. Song and J. Lee, An overview of channel coding for 5G NR cellular communications, APSIPA Transactions on Signal and Information Processing, 8 (2019), 1-14.
doi: 10.1017/ATSIP.2019.10.
|
[3]
|
S.-Y. Chung, G. D. Forney, T. J. Richardson and R. Urbanke, On the design of low-density parity-check codes within 0.0045 db of the Shannon limit, IEEE Communications Letters, 5 (2001), 58-60.
|
[4]
|
A. Dehghan and A. H. Banihashemi, From cages to trapping sets and codewords: A technique to derive tight upper bounds on the minimum size of trapping sets and minimum distance of LDPC codes, IEEE Transactions on Information Theory, 65 (2019), 2062-2074.
doi: 10.1109/TIT.2018.2879823.
|
[5]
|
C. Di, D. Proietti, I. E. Telatar, T. J. Richardson and R. L. Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Transactions on Information Theory, 48 (2002), 1570-1579.
doi: 10.1109/TIT.2002.1003839.
|
[6]
|
L. Dolecek, On absorbing sets of structured sparse graph codes, in Proceedings of the 2010 IEEE Information Theory and Applications Workshop (ITA), (2010), 1–5.
doi: 10.1109/ITA.2010.5454137.
|
[7]
|
L. Dolecek, Z. Zhang, V. Anantharam, M. Wainwright and B. Nikolic, Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes, IEEE Transactions on Information Theory, 56 (2010), 181-201.
doi: 10.1109/TIT.2009.2034781.
|
[8]
|
L. Eroh and A. Schwenk, Cages of girth 5 and 7, Congressus Numerantium, 138 (1999), 157-174.
|
[9]
|
G. Exoo and R. Jajcay, Dynamic cage survey, The Electronic Journal of Combinatorics, 15 (2008), 1-48.
|
[10]
|
J. Feldman, M. J. Wainwright and D. R. Karger, Using linear programming to decode binary linear codes, IEEE Transactions on Information Theory, 51 (2005), 954-972.
doi: 10.1109/TIT.2004.842696.
|
[11]
|
H.-L. Fu, K.-C. Huang and C. A. Rodger, Connectivity of cages, Journal of Graph Theory, 24 (1997), 187-191.
doi: 3.0.CO;2-M">10.1002/(SICI)1097-0118(199702)24:2<187::AID-JGT6>3.0.CO;2-M.
|
[12]
|
Z. Füredi and M. Simonovits, The history of degenerate (bipartite) extremal graph problems, in Erdös Centennial, Springer, 25 (2013), 169–264.
doi: 10.1007/978-3-642-39286-3_7.
|
[13]
|
R. Gallager, Low-density parity-check codes, IRE Transactions on Information Theory, 8 (1962), 21-28.
doi: 10.1109/tit.1962.1057683.
|
[14]
|
H. Hatami, D. G. M. Mitchell, D. J. Costello and T. E. Fuja, Performance bounds and estimates for quantized LDPC decoders, IEEE Transactions on Communications, 68 (2020), 683-696.
|
[15]
|
S. Hoory, The size of bipartite graphs with a given girth, Journal of Combinatorial Theory, Series B, 86 (2002), 215-220.
doi: 10.1006/jctb.2002.2123.
|
[16]
|
C. A. Kelley and D. Sridhara, Pseudocodewords of Tanner graphs, IEEE Transactions on Information Theory, 53 (2007), 4013-4038.
doi: 10.1109/TIT.2007.907501.
|
[17]
|
R. Koetter and P. O. Vontobel, Graph-covers and iterative decoding of finite length codes, in Proceedings of the 3rd International Symposium on Turbo Codes and Related Topics, (2003), 1–5.
|
[18]
|
W. Mantel, Problem 28 (solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff), Wiskundige Opgaven, 10 (1907), 320.
|
[19]
|
T. Richardson, Error floors of LDPC codes, Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, 41 (2003), 1426-1435.
|
[20]
|
M. Schwartz and A. Vardy, On the stopping distance and the stopping redundancy of codes, IEEE Transactions on Information Theory, 52 (2006), 922-932.
doi: 10.1109/TIT.2005.864441.
|
[21]
|
C. E. Shannon, A mathematical theory of communication, Bell System Technical Journal, 27 (1948), 379-423.
doi: 10.1002/j.1538-7305.1948.tb01338.x.
|
[22]
|
R. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, 27 (1981), 533-547.
doi: 10.1109/TIT.1981.1056404.
|
[23]
|
N. Wiberg, Codes and Decoding on General Graphs, PhD thesis, Linkoping University, 1996.
|
[24]
|
Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam and M. Wainwright, Investigation of error floors of structured low-density parity-check codes by hardware emulation, in Proceedings of IEEE Globecom 2006, (2006), 1–6.
doi: 10.1109/GLOCOM.2006.160.
|