2013/12/20 by Akshay Degwekar, Degwekar, Akshay, Kenza Guenda +3
Computer Science · Mathematics · #Algorithm #Coding theory and cryptography #Combinatorics #Computer science #Discrete mathematics #Error detection and correction #FOS: Computer and information sciences #Finite field #Hermitian matrix #Information Theory (cs.IT) #Mathematics #Order (exchange) #Physics #Prime (order theory) #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum convolutional code #Quantum error correction #Quantum information #Quantum mechanics #Quantum-Dot Cellular Automata #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1312.6064
arxiv created 2013/12/20 · openalex publication_date 2013/12/20 · arxiv updated 2013/12/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order p2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic codes to generate new quantum error-correcting codes.