Abstract
We propose a general design of quantum synchronizable codes from classical $q$ -ary cyclic codes. With the aid of classical super/subcodes, the proposed method exploits the idea of chain-containing $q$ -ary cyclic codes when designing quantum synchronizable codes. The distance bound of the resulting quantum synchronizable codes of Calderbank-Shor-Steane (CSS) structure is derived using the representation of Mattson–Solomon polynomial.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
