Results 21 to 30 of about 1,655,518 (300)
arXiv admin note: text overlap with arXiv:1906 ...
Güneri, Cem, Ling, San, Özkaya, Buket
openaire +4 more sources
Quasi-cyclic multi-edge LDPC codes for long-distance quantum cryptography [PDF]
The speed at which two remote parties can exchange secret keys in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of key reconciliation.
Mario Milicevic +3 more
semanticscholar +1 more source
Reproducible families of codes and cryptographic applications
Structured linear block codes such as cyclic, quasi-cyclic and quasi-dyadic codes have gained an increasing role in recent years both in the context of error control and in that of code-based cryptography.
Santini Paolo +2 more
doaj +1 more source
Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9 [PDF]
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over F4 and F9 to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with stricly improved parameters than the current
M. F. Ezerman +3 more
semanticscholar +1 more source
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
How Many Weights Can a Quasi-Cyclic Code Have?
We investigate the largest number of nonzero weights of quasi-cyclic codes. In particular, we focus on the function $\Gamma _{Q}(n,\ell,k,q)$ , that is defined to be the largest number of nonzero weights a quasi-cyclic code of index $\gcd (\ell,n ...
Minjia Shi, Alessandro Neri, P. Solé
semanticscholar +1 more source
On the Construction of Skew Quasi-Cyclic Codes [PDF]
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;θ]$. After a brief description of the skew polynomial ring $F[x;θ]$ it is shown that skew QC codes are left submodules of the ring $R_{s}^{l}=(F[x;θ]/(x^{s}-1))^{l ...
Taher Abualrub +3 more
openaire +3 more sources
Tanner
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu +4 more
doaj +1 more source
On quasi-cyclic subspace codes
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the ...
Ismael Gutiérrez, Ivan Molina
openaire +2 more sources
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles [PDF]
In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite graph, with a given (irregular)
Ali Dehghan, A. Banihashemi
semanticscholar +1 more source

