Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/71930
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorTushar Bagen_US
dc.contributor.authorAshish K. Upadhyayen_US
dc.contributor.authorRamakrishna Bandien_US
dc.contributor.authorRoengchai Tansuchaten_US
dc.date.accessioned2021-01-27T04:18:10Z-
dc.date.available2021-01-27T04:18:10Z-
dc.date.issued2021-02-01en_US
dc.identifier.issn0012365Xen_US
dc.identifier.other2-s2.0-85092919603en_US
dc.identifier.other10.1016/j.disc.2020.112189en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85092919603&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/71930-
dc.description.abstract© 2020 Elsevier B.V. Let p be an odd prime, and k an integer such that k∣(p−1). This paper studies quantum codes from skew cyclic codes over the ring [Formula presented], where q is a power of the prime p. We construct a set of orthogonal idempotents of the ring R and using the set, skew cyclic codes over the ring R are decomposed as direct sum of skew cyclic codes over Fq. We obtain a necessary and sufficient condition for a skew cyclic code to contain its dual. As an application, we construct quantum codes from skew cyclic codes over Fq. It is observed that some quantum codes we constructed are MDS quantum codes.en_US
dc.subjectMathematicsen_US
dc.titleA class of skew cyclic codes and application in quantum codes constructionen_US
dc.typeJournalen_US
article.title.sourcetitleDiscrete Mathematicsen_US
article.volume344en_US
article.stream.affiliationsIndian Institute of Technology Patnaen_US
article.stream.affiliationsTon-Duc-Thang Universityen_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsInternational Institute of Information Technology Naya Raipuren_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.