Efficient Reconciliation of Correlated Continuous Random Variables using LDPC Codes

Simple item page
dc.creatorBloch, Matthieu
dc.creatorThangaraj, Andrew
dc.creatorMcLaughlin, Steven W.
dc.date2005-09-14
dc.date.accessioned2026-07-07T08:15:38Z
dc.date.available2026-07-07T08:15:38Z
dc.descriptionThis paper investigates an efficient and practical information reconciliation method in the case where two parties have access to correlated continuous random variables. We show that reconciliation is a special case of channel coding and that existing coded modulation techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on LDPC codes in the case of correlated Gaussian variables. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on continuous-spectrum quantum states.
dc.description9 pages, 9 figures
dc.identifierhttps://arxiv.org/abs/cs/0509041
dc.identifierhttp://arxiv.org/abs/cs/0509041
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133513
dc.subjectInformation Theory
dc.titleEfficient Reconciliation of Correlated Continuous Random Variables using LDPC Codes
dc.typetext

Files

Collections

arXiv