Codice QR

Constacyclic Codes of Length 3<italic>p</italic><sup><italic>s</italic></sup> Over F<italic><sub>p</sub></italic><sup><italic>m</italic></sup> &#x002B; <italic>u</italic>F<italic><sub>p</sub></italic><sup><italic>m</italic></sup> and Their Application in Various Distance Distributions

Let p &#x2260; 3 be any prime. The structures of all &#x03BB;-constacyclic codes of length 3p<sup>s</sup> over the finite commutative chain ring Fp<sup>m</sup> + uFp<sup>m</sup> (u<sup>2</sup> = 0) are established in the term of their generator polynomials. As an application, Hamming and homogeneous...

Descrizione completa

Salvato in:
Autori principali: Hai Q. Dinh, Bac Trong Nguyen, Woraphon Yamaka
Natura: Artigo
Lingua:Inglês
Pubblicazione: IEEE 2020-01-01
Serie:IEEE Access
Soggetti:
Repeated-root codes
hamming distance
RT distance
homogeneous distance
Accesso online:https://ieeexplore.ieee.org/document/9249409/
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi