Results 21 to 30 of about 115,969 (299)
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
Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes
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
Quasi-Cyclic Stern Proof of Knowledge [PDF]
The ongoing NIST standardization process has shown that Proof of Knowledge (PoK) based signatures have become an important type of possible post-quantum signatures. Regarding code-based cryptography, the main original approach for PoK based signatures is
L. Bidoux, P. Gaborit, N. Sendrier
semanticscholar +1 more source
Bias-tailored quantum LDPC codes [PDF]
Bias-tailoring allows quantum error correction codes to exploit qubit noise asymmetry. Recently, it was shown that a modified form of the surface code, the XZZX code, exhibits considerably improved performance under biased noise.
Joschka Roffe +4 more
doaj +1 more source
Multidimensional Quasi-Cyclic and Convolutional Codes [PDF]
We introduce multidimensional analogues of quasi-cyclic (QC) codes and study their algebraic structure. We demonstrate a concatenated structure for multidimensional QC codes and use this to prove that this class of codes is asymptotically good. We also relate the new family of codes to convolutional codes.
Cem Guneri, Buket Ozkaya
openaire +4 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
Lower Bounds for Quasi-Cyclic Codes and New Binary Quantum Codes
This paper considers three kinds of quasi-cyclic codes of index two with one generator or two generators and their applications in quantum code construction. In accordance with the algebraic structure of linear codes, we determine the lower bounds of the
Yiting Liu +3 more
semanticscholar +1 more source
The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to ...
Andrey N. Sushko +4 more
doaj +1 more source
arXiv admin note: text overlap with arXiv:1906 ...
Güneri, Cem, Ling, San, Özkaya, Buket
openaire +4 more sources
From Skew-Cyclic Codes to Asymmetric Quantum Codes [PDF]
We introduce an additive but not $\mathbb{F}_4$-linear map $S$ from $\mathbb{F}_4^{n}$ to $\mathbb{F}_4^{2n}$ and exhibit some of its interesting structural properties.
A. R. Calderbank +16 more
core +1 more source

