Update bibliography, phrasing, add outlines for sections

src/thesis/bibliography.bib

@@ -1492,3 +1492,40 @@ We study the performance of medium-length quantum LDPC (QLDPC) codes in the depo
 	keywords = {/unread},
 	file = {Full Text PDF:/home/andreas/workspace/work/hiwi/Zotero/storage/PRCEXIWQ/Gallager - 1960 - Low density parity check codes.pdf:application/pdf},
 }
+
+@inproceedings{hassan_fully_2016,
+	title = {Fully parallel window decoder architecture for spatially-coupled {LDPC} codes},
+	issn = {1938-1883},
+	url = {https://ieeexplore.ieee.org/abstract/document/7511553},
+	doi = {10.1109/ICC.2016.7511553},
+	abstract = {Spatially-coupled low-density parity-check (SC-LDPC) codes have been shown to be superior in performance than LDPC block codes. In order to comply with the practical constraints on latency, SC-LDPC codes are decoded using a window decoder that reduces the decoder latency and complexity compared to traditional block-wise decoding. However, so far the literature only considers the structural decoding latency of window decoder, ignoring the processing latency. Note that the processing latency directly impacts the decoder's throughput and is an important parameter in any modern communication system. The throughput of an iterative decoder is directly influenced by the number of iterations and hence in this paper we propose a fully parallel window decoder architecture for SC-LDPC codes where the decoding iterations are performed in parallel. This guarantees a high throughout while fulfilling the low latency requirements. The overall decoding latency (structural and processing latency) of the proposed window decoder architecture is compared with the classical window decoder.},
+	urldate = {2026-03-26},
+	booktitle = {2016 {IEEE} {International} {Conference} on {Communications} ({ICC})},
+	author = {Hassan, Najeeb Ul and Schlüter, Martin and Fettweis, Gerhard P.},
+	month = may,
+	year = {2016},
+	note = {ISSN: 1938-1883},
+	keywords = {/unread, Block codes, Complexity theory, Decoding, Iterative decoding, Sparse matrices, Throughput},
+	pages = {1--6},
+	file = {Full Text PDF:/home/andreas/workspace/work/hiwi/Zotero/storage/TRN7GLTA/Hassan et al. - 2016 - Fully parallel window decoder architecture for spatially-coupled LDPC codes.pdf:application/pdf},
+}
+
+@article{costello_spatially_2014,
+	title = {Spatially coupled sparse codes on graphs: theory and practice},
+	volume = {52},
+	issn = {1558-1896},
+	shorttitle = {Spatially coupled sparse codes on graphs},
+	url = {https://ieeexplore.ieee.org/document/6852099},
+	doi = {10.1109/MCOM.2014.6852099},
+	abstract = {Since the discovery of turbo codes 20 years ago and the subsequent rediscovery of low-density parity check codes a few years later, the field of channel coding has experienced a number of major advances. Until that time, code designers were usually happy with performance that came within a few decibels of the Shannon Limit, primarily due to implementation complexity constraints, whereas the new coding techniques now allow performance within a small fraction of a decibel of capacity with modest encoding and decoding complexity. Due to these significant improvements, coding standards in applications as varied as wireless mobile transmission, satellite TV, and deep space communication are being updated to incorporate the new techniques. In this article, we review a particularly exciting new class of low-density parity check codes called spatially coupled codes, which promise excellent performance over a broad range of channel conditions and decoded error rate requirements.},
+	number = {7},
+	urldate = {2026-03-26},
+	journal = {IEEE Communications Magazine},
+	author = {Costello, Daniel J. and Dolecek, Lara and Fuja, Thomas E. and Kliewer, Jorg and Mitchell, David G.M. and Smarandache, Roxana},
+	month = jul,
+	year = {2014},
+	note = {TLDR: This article reviews a particularly exciting new class of low-density parity check codes called spatially coupled codes, which promise excellent performance over a broad range of channel conditions and decoded error rate requirements.},
+	keywords = {/unread, Block codes, Convolutional codes, Decoding, Iterative decoding, Sparse matrices},
+	pages = {168--176},
+	file = {Full Text PDF:/home/andreas/workspace/work/hiwi/Zotero/storage/WH3R5BMN/Costello et al. - 2014 - Spatially coupled sparse codes on graphs theory and practice.pdf:application/pdf},
+}