Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 26 Apr 2010 in cs.IT and math.IT | (1004.4488v3)

Abstract: In our 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (4)

Collections

Sign up for free to add this paper to one or more collections.