B-Symbol Distance of Constacylic Codes of Length p^s over F<inf>p</inf>^m + uF<inf>p</inf>^m

• المؤلفون الرئيسيون: H. Q. Dinh, Atul Gaur, A. K. Singh, Manoj Kumar Singh, W. Yamaka
• التنسيق: دورية
• منشور في: 2020
• الموضوعات: Computer Science; Engineering; Materials Science
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084107798&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/70463

© 2013 IEEE. In this research paper, the repeated-root constacyclic codes over the chain ring Fpm+ uFpm are considered, where p is a prime and m > 0 is any integer. The b-symbol distance for prime power length, i.e. ps is also studied for any integer s > 0. The Hamming and symbol-pair distance...