Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Interactive Reconciliation with Low-Density Parity-Check Codes (1006.4484v1)

Published 23 Jun 2010 in cs.IT and math.IT

Abstract: Efficient information reconciliation is crucial in several scenarios, being quantum key distribution a remarkable example. However, efficiency is not the only requirement for determining the quality of the information reconciliation process. In some of these scenarios we find other relevant parameters such as the interactivity or the adaptability to different channel statistics. We propose an interactive protocol for information reconciliation based on low-density parity-check codes. The coding rate is adapted in real time by using simultaneously puncturing and shortening strategies, allowing it to cover a predefined error rate range with just a single code. The efficiency of the information reconciliation process using the proposed protocol is considerably better than the efficiency of its non-interactive version.

Citations (13)

Summary

We haven't generated a summary for this paper yet.