Abstract

Let [Formula: see text] be a prime power and let [Formula: see text] be a finite non-chain ring, where [Formula: see text], are polynomials, not all linear, which split into distinct linear factors over [Formula: see text]. We characterize constacyclic codes over the ring [Formula: see text] and study quantum codes from these. As an application, some new and better quantum codes, as compared to the best known codes, are obtained. We also prove that the choice of the polynomials [Formula: see text], [Formula: see text], is irrelevant while constructing quantum codes from constacyclic codes over [Formula: see text], it depends only on their degrees.

Full Text
Paper version not known

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 call

Disclaimer: 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.