Files
ma-thesis/src/thesis/acronyms.tex

145 lines
2.0 KiB
TeX

\DeclareAcronym{qec}{
short=QEC,
long=quantum error correction
}
\DeclareAcronym{dem}{
short=DEM,
long=detector error model
}
\DeclareAcronym{ler}{
short=LER,
long=logical error rate
}
\DeclareAcronym{bp}{
short=BP,
long=belief propagation
}
\DeclareAcronym{bpgd}{
short=BPGD,
long=belief propagation with guided decimation
}
\DeclareAcronym{gdg}{
short=GDG,
long=guided decimation guessing
}
\DeclareAcronym{nms}{
short=NMS,
long=normalized min-sum
}
\DeclareAcronym{osd}{
short=OSD,
long=ordered statistics decoding
}
\DeclareAcronym{aed}{
short=AED,
long=automorphism ensemble decoding
}
\DeclareAcronym{bsc}{
short=BSC,
long=binary symetric channel
}
\DeclareAcronym{spa}{
short=SPA,
long=sum-product algorithm
}
\DeclareAcronym{css}{
short=CSS,
long=Calderbank-Shor-Steane
}
\DeclareAcronym{llr}{
short=LLR,
long=log-likelihood ratio
}
\DeclareAcronym{sc}{
short=SC,
long=spatially coupled
}
\DeclareAcronym{ldpc}{
short=LDPC,
long=low-density parity-check
}
\DeclareAcronym{qldpc}{
short=QLDPC,
long=quantum low-density parity-check
}
\DeclareAcronym{ml}{
short=ML,
long=maximum likelihood
}
\DeclareAcronym{map}{
short=MAP,
long=maximum a posteriori
}
\DeclareAcronym{pcm}{
short=PCM,
long=parity-check matrix
}
\DeclareAcronym{vn}{
short=VN,
long=variable node
}
\DeclareAcronym{cn}{
short=CN,
long=check node
}
\DeclareAcronym{ber}{
short=BER,
long=bit error rate
}
\DeclareAcronym{fer}{
short=FER,
long=frame error rate
}
\DeclareAcronym{awgn}{
short=AWGN,
long=additive white Gaussian noise
}
\DeclareAcronym{pdf}{
short=PDF,
long=probability density function
}
\DeclareAcronym{bb}{
short=BB,
long=bivariate bicycle
}
\DeclareAcronym{hgp}{
short=HGP,
long=hypergraph product
}
\DeclareAcronym{lp}{
short=LP,
long=lifted-product
}
\DeclareAcronym{bpc}{
short=BPC,
long=balanced product code
}