Add SC-LDPC Tanner Graph, fix qualitative LDPC plot, add decoding paragraph
This commit is contained in:
@@ -1,4 +1,23 @@
|
||||
|
||||
@article{dirac_new_1939,
|
||||
title = {A new notation for quantum mechanics},
|
||||
volume = {35},
|
||||
issn = {1469-8064, 0305-0041},
|
||||
url = {https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/abs/new-notation-for-quantum-mechanics/4631DB9213D680D6332BA11799D76AFB},
|
||||
doi = {10.1017/S0305004100021162},
|
||||
abstract = {In mathematical theories the question of notation, while not of primary importance, is yet worthy of careful consideration, since a good notation can be of great value in helping the development of a theory, by making it easy to write down those quantities or combinations of quantities that are important, and difficult or impossible to write down those that are unimportant. The summation convention in tensor analysis is an example, illustrating how specially appropriate a notation can be.},
|
||||
language = {en},
|
||||
number = {3},
|
||||
urldate = {2025-11-28},
|
||||
journal = {Mathematical Proceedings of the Cambridge Philosophical Society},
|
||||
author = {Dirac, P. a. M.},
|
||||
month = jul,
|
||||
year = {1939},
|
||||
note = {TLDR: In mathematical theories the question of notation is yet worthy of careful consideration, since a good notation can be of great value in helping the development of a theory, by making it easy to write down those quantities or combinations of quantities that are important, and difficult or impossible towrite down those that are unimportant.},
|
||||
keywords = {/unread},
|
||||
pages = {416--418},
|
||||
}
|
||||
|
||||
@article{huang_improved_2023,
|
||||
title = {Improved {Noisy} {Syndrome} {Decoding} of {Quantum} {LDPC} {Codes} with {Sliding} {Window}},
|
||||
url = {http://arxiv.org/abs/2311.03307},
|
||||
@@ -1505,7 +1524,7 @@ We study the performance of medium-length quantum LDPC (QLDPC) codes in the depo
|
||||
month = may,
|
||||
year = {2016},
|
||||
note = {ISSN: 1938-1883},
|
||||
keywords = {/unread, Block codes, Complexity theory, Decoding, Iterative decoding, Sparse matrices, Throughput},
|
||||
keywords = {/unread, Decoding, Complexity theory, Iterative decoding, Block codes, 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},
|
||||
}
|
||||
@@ -1525,7 +1544,7 @@ We study the performance of medium-length quantum LDPC (QLDPC) codes in the depo
|
||||
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},
|
||||
keywords = {/unread, Decoding, Iterative decoding, Block codes, Sparse matrices, Convolutional codes},
|
||||
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},
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user