Pages that link to "Item:Q6487414"
From MaRDI portal
The following pages link to On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography (Q6487414):
Displaying 3 items.
- Recent results and problems on constructions of linear codes from cryptographic functions (Q2040307) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- On binary linear codes and binary pseudo-random sequences (Q6580196) (← links)