On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2016

On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes

Gilles Zémor

Dates and versions

hal-01443111 , version 1 (22-01-2017)

Identifiers

Cite

Philippe Gaborit, Gilles Zémor. On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes. IEEE Transactions on Information Theory, 2016, ⟨10.1109/TIT.2016.2616127⟩. ⟨hal-01443111⟩
70 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More