S. Si and . Est-produite-par-un, n, k) codeur convolutif alors pour tout ? multiple de ppcm(a, n), la séquence D ? (S ? )

1. :. Démonstration, s ? * ,1 . . . s ? * ,a avec (s ? * ,1 , . . . , s ? * ,a ) = (s * ,1

?. .. Qam, Schéma de transition d'un mappings Gray réfléchi rectangulaire 32

?. Qam and &. Méthode-de-vitthaladevuni, Construction d'un mapping 128, p.22

L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, pp.284-287, 1974.
DOI : 10.1109/TIT.1974.1055186

J. Barbier, Analyse de canaux de communication dans un contexte non coopératif, Thèse de doctorat, École Polytechnique, 2007.

J. Barbier and J. Letessier, Forward error correcting codes characterization based on rank properties, 2009 International Conference on Wireless Communications & Signal Processing, 2009.
DOI : 10.1109/WCSP.2009.5371733

J. Barbier, G. Sicot, and S. Houcke, Algebraic approach of the reconstruction of linear and convolutional error correcting codes, In World Academy of Science, Engineering and Technology, vol.16, pp.66-71, 2006.

G. Batail, Théorie de l'information, 1997.

M. Bellard and N. Sendrier, Reconstruction of constellation labeling with convolutional coded data, Proceedings of 2012 IEEE International Symposium on Information Theory and its Applications ISITA"2012, pp.653-657, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00880637

C. Blondeau, B. Gérard, and J. P. Tillich, Accurate estimates of the data complexity and success probability for various cryptanalyses. Designs Codes and Cryprography, pp.1-3, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00610101

P. L. Boyd and C. Robertson, Recovery of Unknown Constraint Length and Generator Polynomials for Linear Convolutional Encoders, 21th Century Military Communications Conference, pp.947-951, 2000.

P. L. Boyd and C. Robertson, Recovery of unknown constraint length and generator polynomials for linear convolutional encoders in noise, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155), pp.952-956, 2000.
DOI : 10.1109/MILCOM.2000.904071

M. Burrows and D. J. Wheeler, A Block-sorting Losless Data Compression Algorithm, Research report, 1994.

A. Canteaut and F. Chabaud, A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511, IEEE Transactions on Information Theory, vol.44, issue.1, pp.367-378, 1998.
DOI : 10.1109/18.651067

C. Chabot, Recognition of a code in a noisy environment, 2007 IEEE International Symposium on Information Theory, pp.2211-2215, 2007.
DOI : 10.1109/ISIT.2007.4557548

C. Chabot, Reconnaissance de codes, structure des codes quasi-cycliques, Thèse de doctorat, 2009.

M. Cluzeau, Reconnaissance d'un schéma de codage, Thèse de doctorat, École Polytechnique, 2006.

M. Cluzeau and M. Finiasz, Reconstruction of punctured convolutional codes, 2009 IEEE Information Theory Workshop, 2009.
DOI : 10.1109/ITW.2009.5351168

M. Cluzeau and M. Finiasz, Recovering a code's length and synchronization from a noisy intercepted bitstream, 2009 IEEE International Symposium on Information Theory, pp.2737-2741, 2009.
DOI : 10.1109/ISIT.2009.5205843

M. Cluzeau and J. P. Tillich, On the code reverse engineering problem, 2008 IEEE International Symposium on Information Theory, pp.634-638, 2008.
DOI : 10.1109/ISIT.2008.4595063

URL : https://hal.archives-ouvertes.fr/hal-01081582

M. Côte, Reconnaissance de codes correcteurs d'erreurs, Thèse de doctorat, École Polytechnique, 2010.

M. Côte and N. Sendrier, Reconstruction of convolutional codes from noisy observation, 2009 IEEE International Symposium on Information Theory, pp.546-550, 2009.
DOI : 10.1109/ISIT.2009.5205729

T. M. Cover and J. A. Thomas, Gaussian Channel, Elements of Information Theory, chapter 9, pp.261-299, 2006.

J. Dingel and J. Hagenauer, Parameter Estimation of a Convolutional Encoder from Noisy Observations, 2007 IEEE International Symposium on Information Theory, pp.1776-1780, 2007.
DOI : 10.1109/ISIT.2007.4557147

R. D. Doran, The Gray Code, 2007.

M. Durand, Combinatoire analytique et algorithmique des ensembles de données, 2004.

E. Filiol, Reconstruction of convolutional encoders over GF(q), Cryptography and Coding : 6th IMA Int. Conf, pp.101-109, 1997.
DOI : 10.1007/BFb0024454

E. N. Gilbert, Gray Codes and Paths on the n-Cube. The Bell System Technical Journal, 1958.

X. Liu and R. D. , Profile Optimal 8-QAM and 32-QAM Constellations, 36th Annual Allerton Conference On Communication, Control and Computing, 1998.

P. Lu and Y. Zou, Fast Computations of Gröbner Bases and Blind Recognitions of Convolutional Codes, Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, pp.303-317, 2007.

M. Marazin, Reconnaissance en aveugle de codeur à base de code convolutif : Contribution à la mise en oeuvre d'un récepteur intelligent, Thèse de doctorat, 2009.

M. Marazin, R. Gautier, and G. Burel, Dual Code Method for Blind Identification of Convolutional Encoder for Cognitive Radio Receiver Design, 2009 IEEE Globecom Workshops, 2009.
DOI : 10.1109/GLOCOMW.2009.5360726

URL : https://hal.archives-ouvertes.fr/hal-00485837

M. Marazin, R. Gautier, and G. Burel, Blind recovery of k/n rate convolutional encoders in a noisy environment, EURASIP Journal on Wireless Communications and Networking, vol.2011, issue.1, 2011.
DOI : 10.1109/TIT.1973.1055030

URL : https://hal.archives-ouvertes.fr/hal-00665726

M. Marazin, R. Gautier, and G. Burel, Some interesting dual-code properties of convolutional encoder for standards self-recognition, IET Communications, vol.6, issue.8, pp.931-935, 2012.
DOI : 10.1049/iet-com.2010.0463

URL : https://hal.archives-ouvertes.fr/hal-00714121

R. J. Mceliece, The Algebraic Theory of Convolutional Codes, volume I, chapter 12, pp.1065-1138, 1998.

T. K. Moon, A context for Error Correcting Coding, Error correction Coding, pp.2-52

J. G. Proakis, Modulation and Demodulation for the Additive Gaussian Noise Channel, Digital Communications, pp.220-361

B. Rice, Determining the parameters of a rate 1 n convolutional encoder over GF (q), Third International Conference on Finite Fields and Applications, 1995.

G. Sicot and S. Houcke, Blind detection of interleaver parameters, International Conference on Acoustics, Speech, and Signal Processing, pp.829-832, 2005.

G. Sicot and S. Houcke, Etude Statistique du seuil dans la detection d'entrelaceur, 2005.

V. M. Sidelnikov and S. O. Shestakov, On insecurity of cryptosystems based on generalized reedsolomon codes, Discrete Mathematics and Applications, vol.2, issue.4, pp.439-444, 1992.

J. G. Smith, Odd-Bit Quadrature Amplitude-Shift Keying, IEEE Transactions on Communications, vol.23, issue.3, pp.385-389, 1975.
DOI : 10.1109/TCOM.1975.1092806

G. Ungerboeck, Channel coding with multilevel/phase signals, IEEE Transactions on Information Theory, vol.28, issue.1, 1982.
DOI : 10.1109/TIT.1982.1056454

A. Valembois, Décodage, Détection et Reconnaissance des Codes Linéaires Binaires, Thèse de doctorat, 2000.

A. Valembois, Detection and recognition of a binary linear code, Discrete Applied Mathematics, vol.111, issue.1-2, pp.199-218, 2001.
DOI : 10.1016/S0166-218X(00)00353-X

A. J. Vinck, P. Dolezal, and Y. G. Kim, Convolutional encoder state estimation, IEEE Transactions on Information Theory, vol.44, issue.4, pp.1604-1608, 1998.
DOI : 10.1109/18.681338

A. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Transactions on Information Theory, vol.13, issue.2, pp.260-269, 1967.
DOI : 10.1109/TIT.1967.1054010

P. K. Vitthaladevuni and M. S. Alouini, Exact ber computation for the cross 32-qam constellation, First International Symposium on Control, Communications and Signal Processing, 2004., pp.643-646, 2004.
DOI : 10.1109/ISCCSP.2004.1296484

F. Wang, Z. Huang, and Y. Zhou, A Method for Blind Recognition of Convolution Code Based on Euclidean Algorithm, 2007 International Conference on Wireless Communications, Networking and Mobile Computing, pp.1414-1417, 2007.
DOI : 10.1109/WICOM.2007.358

L. F. Wei, Trellis-coded modulation with multidimensional constellations, IEEE Transactions on Information Theory, vol.33, issue.4, 1987.

R. D. Wesel and X. Liu, Edge profile optimal constellation labeling, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, pp.1198-1202, 2000.
DOI : 10.1109/ICC.2000.853689

R. D. Wesel, X. Liu, J. M. Cioffi, and C. Komminakis, Constellation labeling for linear encoders, IEEE Transactions on Information Theory, vol.47, issue.6, pp.2417-2431, 2001.
DOI : 10.1109/18.945255

K. Whang, B. T. Vander-zanden, and H. M. Taylor, A linear-time probabilistic counting algorithm for database applications, ACM Transactions on Database Systems, vol.15, issue.2, pp.208-229, 1990.
DOI : 10.1145/78922.78925

Y. Wu, Y. Zhao, and H. Li, Constellation Design for Odd-Bit Quadrature Amplitude Modulation, 2010 IEEE Wireless Communication and Networking Conference Workshops, pp.1-4, 2010.
DOI : 10.1109/WCNCW.2010.5487657

H. Xie, X. M. Chai, F. H. Wang, and Z. T. Huang, A method for blind identification of rate 1/2 convolutional code based on improved Euclidean algorithm, 2012 IEEE 11th International Conference on Signal Processing, pp.1307-1310, 2012.
DOI : 10.1109/ICoSP.2012.6491816

Y. Zrelli, R. Gautier, M. Marazin, E. Rannou, and E. Radoi, Focus on theoretical properties of blind convolutional codes identification methods based on rank criterion, 2012 9th International Conference on Communications (COMM), pp.353-356, 2012.
DOI : 10.1109/ICComm.2012.6262570

URL : https://hal.archives-ouvertes.fr/hal-00812412

Y. Zrelli, M. Marazin, R. Gautier, and E. Rannou, Blind Identification of Convolutional Encoder Parameters over GF(2m) in the Noiseless Case, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), 2011.
DOI : 10.1109/ICCCN.2011.6005780

URL : https://hal.archives-ouvertes.fr/hal-00666183