Dresden 2011 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

Q: Fachverband Quantenoptik und Photonik

Q 61: Quantum Information: Concepts and Methods 4

Q 61.9: Talk

Friday, March 18, 2011, 12:30–12:45, SCH A118

Performance of quantum convolutional and block error-correcting codes — •Johannes Gütschow — Institut für Theoretische Physik, Universität Hannover

Quantum convolutional error-correcting codes are often said to have the potential to outperform block codes in terms of code rate and decoding complexity. In this talk we will compare the performance of convolutional codes and block codes under constraints on the size of the encoding and decoding operations (the block length). We will analyze the relation between code rate, the correctable error rate and the block length.

We will first derive a Hamming type bound on the number of correctable errors per block for convolutional codes. Using this bound in different settings we will compare the theoretical performance of convolutional codes to that of block codes and finally give examples for convolutional codes in these settings.