The following pages link to (Q4044441):
Displaying 16 items.
- On decoding algorithms for Goppa codes (Q5153867) (← links)
- A Summary of McEliece-Type Cryptosystems and their Security (Q5295348) (← links)
- Asymptotically good convolutional codes (Q5378516) (← links)
- (Q5513470) (← links)
- Difference-Set Cyclic Codes (Q5530198) (← links)
- Two classes of cyclic extended double-error-correcting Goppa codes (Q6067847) (← links)
- Upper bound on the number of inequivalent extended binary irreducible Goppa codes (Q6080168) (← links)
- Two classes of quasi-cyclic codes via irreducible polynomials (Q6107459) (← links)
- Improving the minimum distance bound of trace Goppa codes (Q6109703) (← links)
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family (Q6114238) (← links)
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext (Q6123051) (← links)
- Decoding McEliece with a hint -- secret Goppa key parts reveal everything (Q6134806) (← links)
- Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory (Q6542660) (← links)
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM} (Q6550587) (← links)
- Negacyclic BCH codes of length \(\frac{q^{2m}-1}{q+1}\) and their duals (Q6564096) (← links)
- Note on the dimension of Goppa codes (Q6602399) (← links)
