1. McEliece R J, A public-key cryptosystem based on algebraic coding theory, Jet Propulsion Laboratory DSN Progress Report, 1978, 114–116.
2. Niederreiter H, Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory, 1986, 15(2): 159–166.
3. Berlekamp E, McEliece R, and van Tilborg H, On the inherent intractability of certain coding problems, IEEE Transactions on Information Theory, 1978, 24(3): 384–386.
4. Barg S, Some new NP-complete coding problems, Problemy Peredachi Informatsii, 1994, 30(3): 23–28.
5. Gaborit P and Zémor G, On the hardness of the decoding and the minimum distance problems for rank codes, IEEE Transactions on Information Theory, 2016, 62(12): 7245–7252.