QSCs from the Euclidean sums of cyclic codes over finite rings

DOI10.1007/s11128-022-03625-3OpenAlexW4291247397WikidataQ114223645 ScholiaQ114223645MaRDI QIDQ2101603

Yanqing Dai, Xiu-sheng Liu

Publication date: 6 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-022-03625-3

zbMATH Keywords

cyclotomic polynomialsquantum synchronizable codesEuclidean sums of cyclic codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Quantum coding (general) (81P70)

Uses Software

• Magma

Cites Work

• Unnamed Item
• A class of constacyclic codes over \(\mathbb F_{p}+v\mathbb F_{p}\) and its Gray image
• The Magma algebra system. I: The user language
• On the structure of linear and cyclic codes over a finite chain ring
• Algebraic quantum synchronizable codes
• Quantum synchronizable codes from the Whiteman's generalized cyclotomy
• Quantum synchronizable codes from finite rings
• Quantum Synchronizable Codes From Finite Geometries
• Cyclic and Negacyclic Codes Over Finite Chain Rings
• Fundamentals of Error-Correcting Codes
• Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
• Quantum error correction via codes over GF(4)
• Synchronizable error-correcting codes

This page was built for publication: QSCs from the Euclidean sums of cyclic codes over finite rings