DMCA
A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design (2007)
Cached
Download Links
by
Salah A. Aly
| Citations: | 5 - 0 self |
BibTeX
@MISC{Aly07aclass,
author = {Salah A. Aly},
title = {A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Low Density Parity Check (LDPC) codes derived from Latin squares. The parity check matrices of these codes are constructed by permuting shift-orthogonal Latin squares of order n in blockrows and block-columns. I show that the constructed LDPC codes are self-orthogonal and their minimum and stopping distances are bounded. This helps us to construct a family of quantum LDPC block codes. Consequently, we demonstrate that these constructed codes have good error correction capabilities and can be decoded using iterative decoding algorithms similar to their classical counterpart. I.
