Sur la complexité d'un problème de codage
Antoine Lobstein; Gérard Cohen
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1987)
- Volume: 21, Issue: 1, page 25-32
- ISSN: 0988-3754
Access Full Article
topHow to cite
topLobstein, Antoine, and Cohen, Gérard. "Sur la complexité d'un problème de codage." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 21.1 (1987): 25-32. <http://eudml.org/doc/92275>.
@article{Lobstein1987,
author = {Lobstein, Antoine, Cohen, Gérard},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {binary linear code; NP-completeness; minimal weight codeword},
language = {fre},
number = {1},
pages = {25-32},
publisher = {EDP-Sciences},
title = {Sur la complexité d'un problème de codage},
url = {http://eudml.org/doc/92275},
volume = {21},
year = {1987},
}
TY - JOUR
AU - Lobstein, Antoine
AU - Cohen, Gérard
TI - Sur la complexité d'un problème de codage
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1987
PB - EDP-Sciences
VL - 21
IS - 1
SP - 25
EP - 32
LA - fre
KW - binary linear code; NP-completeness; minimal weight codeword
UR - http://eudml.org/doc/92275
ER -
References
top- 1. E. R. BERLEKAMP, R. J. MACELIECE et H. C. A. VAN TILBORG, On the Inherent Intractability of Certain Coding Problems, I.E.E.E. Trans, on Information Theory, vol. IT-24, n° 3, mai 1978. Zbl0377.94018MR495180
- 2. M. R. GAREY et D. S. JOHNSON, Computers and Intractability: a Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1978. Zbl0411.68039MR519066
- 3. S. C. INTAFOS et S. L. HAKIMI, On the Complexity of Some Coding Problems, I.E.E.E. Trans. on Information Theory, vol. IT-27, n° 6, novembre 1981. Zbl0465.94021MR650720
- 4. R. L. GRAHAM, Communication personnelle.
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.