1. Aguilar Melchor, C., et al.: ROLLO-Rank-Ouroboros, LAKE & LOCKER. NIST PQC Call for Proposals (2020)
2. Aguilar Melchor, C., et al.: Rank Quasi-Cyclic (RQC). NIST PQC Call for Proposals (2020)
3. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 298–307. IEEE (2003)
4. Astola, J.: On the asymptotic behaviour of Lee-codes. Discret. Appl. Math. 8(1), 13–23 (1984)
5. Barg, A.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23–28 (1994)