LDPC	Low-density parity-check
QC	Quasi-cyclic
BIBD	Balanced incomplete block design
CPM	Circulant permutation matrix
QC-LDPC	Quasi-cyclic low-density parity-check
SPA	Sum-product algorithm
${\mathbb{F}}_p$	Finite field of order p
${\mathbb{F}}_p^{*}$	Multiplicative group of order $p-1$
G(p)	A (3, 29)-regular bipartite graph
p ≡ 1 $(\mathrm{mod}JL)$	Condition for existence of primitive JL-th root (for our parameters, JL = 87)
$2h$-cycle	A cycle of length $2h$
${\Phi }_{87}(x)$	87th cyclotomic polynomial
GCD	Greatest common divisor
$S_6$	The prime set corresponding to girth 6
$S_8$	The prime set corresponding to girth 8
$S_{10}$	The prime set corresponding to girth 10
$\mathbf{H}$	Parity-check matrix
EXIT	Extrinsic information transfer
VND	Variable-node decoder
CND	Check-node decoder
AWGN	Additive white Gaussian noise
BPSK	Binary phase shift keying
SNR	Signal-to-noise ratio
BER	Bit error rate
FER	Frame error rate