IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i20p2554-d654245.html
   My bibliography  Save this article

Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)

Author

Listed:
  • Mohammed E. Charkani

    (Department of Mathematics, Faculty of Sciences Dhar El Mahraz, University Sidi Mohamed Ben Abdallah, B.P. 1796, Fès-Atlas, Fès 30003, Morocco)

  • Hai Q. Dinh

    (Department of Mathematical Sciences, Kent State University, Warren, OH 44483, USA)

  • Jamal Laaouine

    (Department of Mathematics, Faculty of Sciences Dhar El Mahraz, University Sidi Mohamed Ben Abdallah, B.P. 1796, Fès-Atlas, Fès 30003, Morocco)

  • Woraphon Yamaka

    (Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Chiang Mai 52000, Thailand)

Abstract

Let p be a prime, s , m be positive integers, γ be a nonzero element of the finite field F p m , and let R = F p m [ u ] / ⟨ u 3 ⟩ be the finite commutative chain ring. In this paper, the symbol-pair distances of all γ -constacyclic codes of length p s over R are completely determined.

Suggested Citation

  • Mohammed E. Charkani & Hai Q. Dinh & Jamal Laaouine & Woraphon Yamaka, 2021. "Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)," Mathematics, MDPI, vol. 9(20), pages 1-15, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:20:p:2554-:d:654245
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/20/2554/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/20/2554/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:20:p:2554-:d:654245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.