Results 1 to 10 of about 2,635,004 (136)
On Symbol-Triple Distance of a Class of Constacyclic Codes of Length 3
IEEE Access, 2023 Let $p\not =3$ be any prime. In this paper, we completely determine symbol-triple distance of all $\gamma $ -constacyclic codes of length $3p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , where
Hai Q. Dinh +3 more
doaj +2 more sources
On Symbol-Pair Distance of a Class of Constacyclic Codes of Length 3ps over
Axioms, 2023 Let p≠3 be any prime. In this paper, we compute symbol-pair distance of all γ-constacyclic codes of length 3ps over the finite commutative chain ring R=Fpm+uFpm, where γ is a unit of R which is not a cube in Fpm.
Hai Q. Dinh +2 more
doaj +2 more sources
A tight upper bound on the number of non-zero weights of a constacyclic code [PDF]
Finite Fields Their Appl., 2023 For a simple-root $\lambda$-constacyclic code $\mathcal{C}$ over $\mathbb{F}_q$, let $\langle\rho\rangle$ and $\langle\rho,M\rangle$ be the subgroups of the automorphism group of $\mathcal{C}$ generated by the cyclic shift $\rho$, and by the cyclic shift
Han Zhang, X. Cao
semanticscholar +1 more source
A generalization of cyclic code equivalence algorithm to constacyclic codes [PDF]
Designs, Codes and Cryptography, 2021 Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes.
Dev Akre +3 more
semanticscholar +1 more source
Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes
Mathematics, 2023 We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to the well-known BCH bound for cyclic codes.
Adel Alahmadi +2 more
doaj +1 more source
Quantum Codes Obtained from Skew ϱ‐λ‐Constacyclic Codes over Rk
Quantum Engineering, Volume 2023, Issue 1, 2023., 2023 Let Rk=Fqu1,u2,⋯,uk/
Bo Kong +4 more
wiley +1 more source
Characterizations and Properties of Monic Principal Skew Codes over Rings
Security and Communication Networks, Volume 2022, Issue 1, 2022., 2022 Let A be a ring with identity, σ a ring endomorphism of A that maps the identity to itself, δ a σ‐derivation of A, and consider the skew‐polynomial ring A[X; σ, δ]. When A is a finite field, a Galois ring, or a general ring, some fairly recent literature used A[X; σ, δ] to construct new interesting codes (e.g., skew‐cyclic and skew‐constacyclic codes ...
Mhammed Boulagouaz +2 more
wiley +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A. +1 more
doaj +1 more source
Matrix‐Product Codes over Commutative Rings and Constructions Arising from (σ, δ)‐Codes
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 A well‐known lower bound (over finite fields and some special finite commutative rings) on the Hamming distance of a matrix‐product code (MPC) is shown to remain valid over any commutative ring R. A sufficient condition is given, as well, for such a bound to be sharp. It is also shown that an MPC is free when its input codes are all free, in which case
Mhammed Boulagouaz +2 more
wiley +1 more source