Sur la complexité d'un problème de codage
RAIRO-Theor. Inf. Appl., 21 1 (1987) 25-32
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Communications, Signal Processing, and Systems
Zhiping Shi, Shujun Zhang, Fengcheng Lyu, et al.Lecture Notes in Electrical Engineering, Communications, Signal Processing, and Systems 517 1031 (2020)
https://doi.org/10.1007/978-981-13-6508-9_125
Covering Codes
North-Holland Mathematical Library, Covering Codes 54 479 (1997)https://doi.org/10.1016/S0924-6509(97)80023-2
Covering Codes
North-Holland Mathematical Library, Covering Codes 54 495 (1997)https://doi.org/10.1016/S0924-6509(13)70005-9
The intractability of computing the minimum distance of a code
A. VardyIEEE Transactions on Information Theory 43 (6) 1757 (1997)
https://doi.org/10.1109/18.641542
Coding Theory and Applications
J. Fang, G. Cohen, P. Godlewski and G. BattailLecture Notes in Computer Science, Coding Theory and Applications 311 141 (1988)
https://doi.org/10.1007/3-540-19368-5_15