Results 1 to 10 of about 95,269 (216)
New Construction of Maximum Distance Separable (MDS) Self-Dual Codes over Finite Fields [PDF]
Maximum distance separable (MDS) self-dual codes have useful properties due to their optimality with respect to the Singleton bound and its self-duality.
Aixian Zhang, Zhe Ji
doaj +2 more sources
Some New Quantum BCH Codes over Finite Fields
Quantum error correcting codes (QECCs) play an important role in preventing quantum information decoherence. Good quantum stabilizer codes were constructed by classical error correcting codes.
Lijuan Xing, Zhuo Li
doaj +1 more source
On Symbol-Triple Distance of a Class of Constacyclic Codes of Length 3
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 +1 more source
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
Self-Dual Codes, Symmetric Matrices, and Eigenvectors
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ using symmetric matrices and eigenvectors from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$ . Using this method, which is called a
Jon-Lark Kim, Whan-Hyuk Choi
doaj +1 more source
Extremal Binary and Ternary Codes of Length 60 with an Automorphism of Order 29 and a Generalization
In this paper, all extremal Type I and Type III codes of length 60 with an automorphism of order 29 are classified up to equivalence. In both cases, it has been proven that there are three inequivalent codes.
Stefka Bouyuklieva +2 more
doaj +1 more source
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m
Let $p\not =5$ be any odd prime. Using the algebraic structures of all cyclic codes of length $5p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , in this paper, the exact values of Hamming ...
Hai Q. Dinh +3 more
doaj +1 more source
On Symbol-Pair Distance of a Class of Constacyclic Codes of Length 3ps over
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 +1 more source
A code over Gaussian or Eisenstein integer residue ring is an additive group of vectors with entries in this integer residue ring which is closed under the action of constant multiplication by the Gaussian or Eisenstein integers. In this paper, we define
Hajime Matsui
doaj +1 more source
On Reversibility and Self-Duality for Some Classes of Quasi-Cyclic Codes
In this work, we study two classes of quasi-cyclic (QC) codes and examine how several properties can be combined into the codes of these classes. We start with the class of QC codes generated by diagonal generator polynomial matrices; a QC code in this ...
Ramy Taki Eldin, Hajime Matsui
doaj +1 more source

