.:. Consultation > Par domaines > Théorie de l'information et codage .:.

197 documents classés par : Date Titre Nom du premier auteur Type de documents Date de dépôt

... 3 - 4 - 5 - 6 - 7 - 8 - 9 ...

Décodage en liste et application à la sécurité de l'information Barbier M. Ecole Polytechnique X (02/12/2011), Daniel Augot, Caroline Fontaine (Dir.) [pastel-00677421 - version 1]

Algorithmic tests and randomness with respect to a class of measures Bienvenu L., Gacs P., Hoyrup M., Rojas C., Shen A. Proceedings of the Steklov Institute of Mathematics 274, 1 (2011) 34-89 [hal-00644785 - version 1]

Wet paper codes and the dual distance in steganography Munuera C., Barbier M. Advances in mathematics of communications (2011) [inria-00584877 - version 1]

The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing Carrascosa R., Coste F., Gallé M., Infante-Lopez G. Algorithms, 4 (2011) 262-284 [inria-00638445 - version 1]

Anti-sparse coding for approximate nearest neighbor search Jégou H., Furon T., Fuchs J.-J. N° RR-7771 (2011) [inria-00633193 - version 2]

List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound Augot D., Barbier M., Couvreur A. Dans IEEE Information Theory Workshop (2011) 229 - 233 [hal-00643794 - version 1]

An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations Zeh A., Gentner C., Augot D. IEEE Transactions on Information Theory (2011) [inria-00633205 - version 1]

MDLChunker: A MDL-Based Cognitive Model of Inductive Learning Robinet V., Lemaire B., Gordon M. B. Cognitive Science 35, 7 (2011) 1352-1389 [hal-00624819 - version 1]

Construction of rational surfaces yielding good codes Couvreur A. Finite Fields and Their Applications 17, 5 (2011) 424-441 [inria-00547454 - version 1]

Image Compression Using Sparse Representations and the Iteration-Tuned and Aligned Dictionary Zepeda J., Guillemot C., Kijak E. IEEE Journal of Selected Topics in Signal Processing 5, 5 (2011) 1061 -1073 [hal-00647264 - version 1]