Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length 3ps.

In this paper, we use the CSS and Steane's constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length 3 p s over F p m . We obtain several new classes of QEC codes in the sense that their parameters are different from all the previous constructions. Among them, we identify all quantum MDS (briefly, qMDS) codes, i.e., optimal quantum codes with respect to the quantum Singleton bound. In addition, we construct quantum synchronizable codes (briefly, QSCs) from cyclic codes of length 3 p s over F p m . Furthermore, we give many new QSCs to enrich the variety of available QSCs. A lot of them are QSCs codes with shorter lengths and much larger minimum distances than known non-primitive narrow-sense BCH codes. [ABSTRACT FROM AUTHOR]