Results 1 to 10 of about 2,328 (103)
Some New Quantum BCH Codes over Finite Fields. [PDF]
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.
Xing L, Li Z.
europepmc +4 more sources
Asymmetric Entanglement-Assisted Quantum MDS Codes Constructed from Constacyclic Codes. [PDF]
Due to the asymmetry of quantum errors, phase-shift errors are more likely to occur than qubit-flip errors. Consequently, there is a need to develop asymmetric quantum error-correcting (QEC) codes that can safeguard quantum information transmitted ...
Chen J +7 more
europepmc +2 more sources
On cyclotomic cosets and code constructions
New properties of $q$-ary cyclotomic cosets modulo $n = q^{m} - 1$, where $q \geq 3$ is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of classical cyclic codes can be computed.
La Guardia, Giuliano G. +1 more
openaire +5 more sources
A General Construction of Integer Codes Correcting Specific Errors in Binary Communication Channels
Integer codes have been successfully applied to various areas of communication and computer technology. They demonstrate good performance in correcting specific kinds of errors.
Hristo Kostadinov, Nikolai Manev
doaj +1 more source
Integer Codes Correcting Asymmetric Errors in Nand Flash Memory
Memory devices based on floating-gate transistor have recently become dominant technology for non-volatile storage devices like USB flash drives, memory cards, solid-state disks, etc.
Hristo Kostadinov, Nikolai Manev
doaj +1 more source
Construction of Standard Solid Sudoku Cubes and 3D Sudoku Puzzles
In this paper, standard solid Sudoku cubes (SSSCs), a three-dimensional (3D) extension of Sudoku tables, are introduced, and a method to construct these cubes is presented. This is the first class of standard solid Sudoku cubes. An SSSC of order $m$ is
Mehrab Najafian +2 more
doaj +1 more source
Constacyclic Codes over Finite Chain Rings of Characteristic p
Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this paper, we study λ-constacyclic codes of an arbitrary length N over R, where λ is a unit of R.
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
Construction of Some New Quantum BCH Codes
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes over finite fields have been studied extensively. One can construct quantum stabilizer codes with good parameters using classical BCH codes. In this paper, our goal is to find such classical BCH codes.
Ming Zhang +3 more
doaj +1 more source
Pelikán's conjecture and cyclotomic cosets
AbstractThe following conjecture was recently made by J. Pelikán. Let a0 ,…, an be an (n + 1)-tuple of 0's and 1's; let Ak = ϵi=0n−kaiai+k for k = 0,…, n. Then if n ⩾ 4 some Ak is even.This paper shows that Pelikán's conjecture is false for infinitely many values of n. On the other hand it is also shown that the conjecture is true for most values of n,
MacWilliams, F.J., Odlyzko, A.M.
openaire +2 more sources
A general approach to construction and determination of the linear complexity of sequences based on cosets [PDF]
We give a general approach to $N$-periodic sequences over a finite field $\F_q$ constructed via a subgroup $D$ of the group of invertible elements modulo $N$. Well known examples are Legendre sequences or the two-prime generator. For some generalizations
Cesmelioglu, Ayca +2 more
core +1 more source

