vix.ing · top · new · best · stats · spec

Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes "

2010/04/26 by Dazu Huang, Zhigang Chen, Huang, Dazu +5
Computer Science · Mathematics · #Advanced Data Storage Technologies #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1004.4488

Some readers have falsely assumed that I am a co-author of the "Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check code'"

openalex publication_date 2010/04/26 · arxiv created 2011/11/07 · arxiv updated 2015/03/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

In our recent paper entitled "Quantum Quasi-Cyclic Low-Density Parity-Check codes" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can be constructed via the CSS encoding/decoding approach with various lengths and rates. However, the further investigation shows that the proposed construction may steal some ideas from the paper entitled "Quantum Quasi-Cyclic LDPC codes" [quant-ph/0701020v2]. We feel that the apologizing point of the original protocol is that some results are almost similar to that of construction methods with algebraic combinatorics although we suggest the different approach for improving them. Also, there is a weak point of the original coding approach while considering the application of codes in imperfect channels.

Related