Sign Up to like & get
recommendations!
0
Published in 2025 at "IEEE Access"
DOI: 10.1109/access.2025.3618760
Abstract: Code-based cryptography is particularly relevant in contemporary research, as it offers the potential to resist attacks from future quantum computers, which could easily compromise many current cryptographic algorithms. Motivated by this critical need for quantum-resistant…
read more here.
Keywords:
cryptography;
tex math;
goppa codes;
inline formula ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2022.3178110
Abstract: In this paper, we determine all dihedral subgroups in $PGL_{2}(\mathbb {F}_{q})$ , where $q=2^{l}$ and $l$ is a positive integer; and construct binary expurgated and extended Goppa codes with dihedral automorphism groups. Moreover, it is…
read more here.
Keywords:
goppa codes;
tex math;
inline formula;
extended goppa ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2024.3462712
Abstract: Classical Goppa codes are a well-known class of codes with applications in code-based cryptography, which are a special case of alternant codes. Many papers are devoted to the search for Goppa codes with a cyclic…
read more here.
Keywords:
inline formula;
tex math;
goppa codes;
Sign Up to like & get
recommendations!
0
Published in 2025 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2025.3598582
Abstract: Galois hulls of MDS codes can be applied to construst MDS entanglement-assisted quantum error-correcting codes (EAQECCs). Goppa codes over $\mathbb {F}_{q^{m}}$ are generalized Reed-Solomon codes (GRS codes) when $m=1$ . In this paper, we give…
read more here.
Keywords:
galois;
inline formula;
tex math;
goppa codes ... See more keywords