A robust family of quantum-resistant cryptographic algorithms
based on the assumed computational complexity of decoding random linear code. In particular, certain algorithms, such as Classic McEliece (NIST post-quantum competition finalist), BIKE and HQC (both NIST post-quantum competition alternate finalists).
Cryptographic algorithms from this family are relatively efficient but generate large keys. Besides, they are rather conservative security-wise. Since 1978 cryptanalysts have been failing to significantly reduce the number of operations required to compromise code-based cryptographic systems, provided their parameters were chosen correctly.