Recognition: unknown
Insertion Correcting Capability for Quantum Deletion-Correcting Codes
classification
💻 cs.IT
math.IT
keywords
quantumcodesinsertioncapabilityconditioncorrectingdeletiondistance
read the original abstract
This paper proves that any quantum t-deletion-correcting codes also correct a total of t insertion and deletion errors under a certain condition. Here, this condition is that a set of quantum states is defined as a quantum error-correcting code if the error spheres of its states are disjoint, as classical coding theory. In addition, this paper proposes the quantum indel distance and describes insertion and deletion errors correcting capability of quantum codes by this distance.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
A decoding algorithm is provided for composite deletion-insertion errors in quantum deletion-correcting codes based on quantum Reed-Solomon codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.