Quasi-dyadic Codes
Quasi-Dyadic Codes is a class of linear codes characterized by a quasi-dyadic structure in their generator matrices, distinguishing them through efficient algebraic properties that enable compact key representation and enhanced computational efficiency in code-based cryptographic systems.
10
Publications
256
Citations
27
Authors
34
Institutions
Publications per year
2017–2026
2
Parents
10
1–5 of 10
27
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 70 citations
3
h-index
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 70 citations
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 27
34
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
5 publications
103 citations
Universidade de São Paulo
São Paulo, Brazil
3 h-index
3 publications
70 citations
State Key Laboratory of Cryptology
Beijing, China
2 h-index
3 publications
62 citations

Sorbonne Université
Paris, France
2 h-index
6 publications
147 citations
Normandie Université
Caen, France
2 h-index
2 publications
49 citations
Florida Atlantic University
Boca Raton, United States
2 h-index
2 publications
54 citations
CS Communication & Systèmes (France)
Le Plessis-Robinson, France
1 h-index
3 publications
111 citations
University of Washington Tacoma
Tacoma, United States
1 h-index
1 publications
28 citations
1–8 of 34
JMC · 2 publications · 81 citations
2
h-index
2 publications · 50 citations
2
h-index
Repository · 1 publications · 21 citations
1
h-index
JETC · 1 publications · 26 citations
1
h-index
LNCS · Book series · 1 publications · 20 citations
1
h-index
1–5