Name
Abstract | ||
|---|---|---|
Although quantum key distribution (QKD) comes from the development of quantum theory, the implementation of a practical QKD system does involve a lot of classical process, such as key reconciliation and privacy amplification, which is called post-processing. Post-processing has been a crucial element to high speed QKD systems, even the bottleneck of it because of its relatively high time consumption. Low density parity check (LDPC) is now becoming a promising approach of overcoming the bottleneck due to its good performance in processing throughput. In this article we propose and simulate an easily implemented but efficiently rate-adaptive LDPC coding approach of reconciliation, different from the previously proposed puncturing- and shortening-based approach. We also give a measure for choosing the optimal LDPC parameter for our rate-adaptive approach according to error rates. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Quantum key distribution,Bottleneck,Low-density parity-check code,Algorithm,Coding (social sciences),Throughput,Puncturing,Mathematics |
DocType | Volume | Citations |
Journal | abs/1505.06423 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mo Li | 1 | 3 | 1.79 |
| Chun-Mei Zhang | 2 | 7 | 4.71 |
| Zhen-Qiang Yin | 3 | 8 | 4.93 |
| Wei Chen | 4 | 4 | 2.58 |
| Chuan Wang | 5 | 34 | 3.90 |
| zhengfu han | 6 | 1 | 1.39 |