2007/11/13 by Kenza Guenda, Guenda, Kenza
Computer Science · Mathematics · #94B05 #94B15 #94B60 #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata #cs.IT #math.IT #msc:94B05 #msc:94B15 #msc:94B60
paper · pdf · doi:10.48550/arxiv.0711.2050
arxiv created 2007/11/13 · openalex publication_date 2007/11/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived from the classical duadic codes. This answer an open problem asked by Aly et al.