Gaborit, P., & Zemor, G. (2016). On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes. IEEE Transactions on Information Theory, 62(12), 7245-7252. https://doi.org/10.1109/TIT.2016.2616127
Chicago Style (17th ed.) CitationGaborit, Philippe, and Gilles Zemor. "On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes." IEEE Transactions on Information Theory 62, no. 12 (2016): 7245-7252. https://doi.org/10.1109/TIT.2016.2616127.
MLA (9th ed.) CitationGaborit, Philippe, and Gilles Zemor. "On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes." IEEE Transactions on Information Theory, vol. 62, no. 12, 2016, pp. 7245-7252, https://doi.org/10.1109/TIT.2016.2616127.
Warning: These citations may not always be 100% accurate.