, Pour traiter ce problème, nous procédons en troisétapes : 1. Démontrer que a l,i peut s'écrire : a l,i = mod

, The 3 rd Generation Partnership Project, Technical Specification Group GSM/EDGE Radio Access Network, 2005.

, The 3 rd Generation Partnership Project, Technical Specification Group Radio Access Network, 3GPP TS 25.212 v6.5.0, 2005.

. 3gpp2-c.s0002-e-v0, Physical layer Standard for CDMA2000 Spread Spectrum Systems (Revision E), vol.99, 2009.

J. Barbier, Reconstruction of turbo-code encoders, Proceedings of SPIE Security and Defence, Space Communication Technologies Symposium, vol.5819, pp.463-473, 2005.

J. Barbier, Analyse de canaux de communication dans un contexte non coopéra-tif : application aux codes correcteurs d'erreurs età la stéganalyse, 2007.

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.

L. Barnault and D. Declercq, Fast decoding algorithm for LDPC over GF(2 q ), Proceedings ITW, pp.70-73, 2003.

C. Berrou, Codes et turbocodes, 2006.
DOI : 10.1002/9780470612422.ch5
URL : https://hal.archives-ouvertes.fr/hal-01801570

G. Burel and R. Gautier, Blind estimation of encoder and interleaver characteristics in a non cooperative context, IASTED International Conference on Communications, Internet and Information Technology, 2003.

J. Barbier and J. Letessier, Forward error correcting codes characterization based on rank properties, Proc. of IEEE International Conference on Wireless Communications and Signal Processing, vol.09, 2009.

P. Bogaert, Probabilités pour scientifiques et ingénieurs : Introduction au calcul des probabilités, 2005.

R. C. Bose and D. K. Ray-chaudhuri, On a class of error correcting binary group codes, Information and Control, vol.3, issue.3, pp.68-79, 1960.

J. Briffa and H. Schaathun, Non-binary turbo codes and applications, 5th International Symposium on Turbo Codes and Related Topics, 2008.

J. Barbier, G. Sicot, and S. Houcke, Algebraic approach for the reconstruction of linear and convolutional error correcting codes, International Journal of Applied Mathematics and Computer Sciences, vol.2, issue.3, pp.113-118, 2006.
URL : https://hal.archives-ouvertes.fr/hal-02122191

A. Canteaut, A new algorithm for finding minimum-weight words in a linear code : Application to mcelieces cryptosystem and to narrow-sense bch codes of length 511, IEEE Transactions on Information Theory, vol.44, pp.367-378, 1998.

W. R. Carson, I. Chatzigeorgiou, I. J. Wassell, M. R. Rodrigues, and R. Carrasco, On the performance of iterative demapping and decoding techniques over quasi-static fading channels, IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pp.1-5, 2007.

A. Cde-+-05]-jinghu-chen, E. Dholakia, M. P. Eleftheriou, X. Fossorier, and . Hu, Reducedcomplexity decoding of LDPC codes, IEEE Transactions on Communications, vol.53, issue.8, pp.1288-1299, 2005.

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

M. Cluzeau, Block code reconstruction using iterative decoding techniques, 2006 IEEE International Symposium on Information Theory, pp.2269-2273, 2006.

M. Cluzeau, Reconnaissance d'un schéma de codage, Ecole Polytechnique, 2006.

J. W. Craig, A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations, Military Communications Conference, vol.2, pp.571-555, 1991.

J. B. Chennakeshu, S. , and A. , Error rates for rayleigh fading multichannel reception of mpsk signals, IEEE Transactions on Communications, vol.43, issue.234, pp.338-346, 1995.

H. Ahmed, A. Desoky, and . Ashikhmin, Cryptography software system using galois field arithmetic, IEEE Information Assurance Workshop, pp.386-387, 2006.

D. Declercq, M. Colas, and G. Gelle, Regular gf(2 q )-ldpc coded modulations for higher order qam-awgn channels, ISITA 04, 2004.

D. Declercq and M. Fossorier, Extended minsum algorithm for decoding LDPC codes over GF(q), Proceedings ISIT, p.464, 2005.

D. Declercq and M. Fossorier, Decoding algorithms for nonbinary LDPC codes over GF(q), IEEE Transactions on Communications, vol.55, issue.4, pp.633-643, 2007.

M. Davey and D. Mackay, Low density parity check codes over gf(q), Information Theory Workshop, pp.70-71, 1998.

M. C. Davey and D. Mackay, Low-density parity-check codes over GF(q), IEEE Communications Letters, vol.2, pp.165-167, 1998.

P. Elias, Error-free coding, Transactions of the IRE Professional Group on Information Theory, vol.4, issue.4, pp.29-37, 1954.

E. , Reconstruction of convolutional encoders over gf(p), Cryptography and Coding ; proceedings of the 6th IMA Conference, p.1355, 1997.

E. , Reconstruction of punctured convolutional encoders, International Symposium on Information Theory and Application (ISITA), pp.4-7, 2000.

E. , Technique de reconstruction en cryptologie et théorie des codes, 2001.

G. D. Forney, Convolutional codes i : Algebraic structure, IEEE Transactions on Information Theory, vol.16, issue.6, pp.720-738, 1970.

R. G. Gallager, Low-density parity-check codes, IRE Transactions on Information Theory, vol.8, issue.1, pp.21-28, 1962.

R. G. Gallager, Low-Density Parity-Check Codes, 1963.

J. Guajardo, S. S. Kumar, C. Paar, and J. Pelzl, Efficient software-implementation of finite fields with applications to cryptography, Acta Applicandae Mathematica, vol.93, issue.1-3, pp.3-32, 2006.

N. Gu, Adaptive blind channel equalization based on constellation information of mpsk signal, IEEE International Conference on Industrial Technology. ICIT 2005, pp.146-151, 2005.

R. W. Hamming, Error detecting and error correcting codes, BELL System Technical Journal, vol.29, issue.2, pp.147-160, 1950.

X. Y. Hu, E. Eleftheriou, and D. Arnold, Regular and irregular progressive edgegrowth tanner graphs, IEEE Transactions on Information Theory, vol.51, issue.1, pp.386-398, 2005.

A. Hocquenghem, Codes correcteurs d'erreurs. Chiffres, vol.2, pp.147-156, 1959.

M. T. Hossain, Cooperative communications : Synchronization in fast flat-fading channels with various signal constellations, IEEE Eleventh International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp.1-5, 2010.

N. K. Jablon, Joint blind equalization, carrier recovery and timing recovery for highorder qam signal constellations, IEEE Transactions on Signal Processing, vol.40, issue.6, pp.1383-1398, 1992.

S. J. Johnson and S. R. Weller, Construction of low-density parity-check codes from kirkman triple systems, IEEE Global Telecommunications Conference, vol.2, pp.970-974, 2001.

M. Karabacak, H. A. Cirpan, and H. Arslan, Cooperative communications : Synchronization in fast flat-fading channels with various signal constellations, IEEE Radio and Wireless Symposium, pp.146-149, 2011.

Y. Kou, S. Lin, and P. C. Fossorier, Low density parity check codes based on finite geometries : A rediscovery and new results, IEEE Trans. Inform. Theory, vol.47, pp.2711-2736, 2001.

J. Lu, T. T. Tjhung, and C. C. Chai, Error probability performance of l-branch diversity reception of mqam in rayleigh fading, IEEE Transactions on Communications, vol.46, issue.2, pp.179-181, 1998.

D. J. Mackay, Good error-correcting codes based on very sparse matrices, IEEE Trans. Inform. Theory, vol.45, issue.2, pp.399-431, 1999.

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

D. J. Mackay and M. C. Davey, Evaluation of gallager codes for short block length and high rate applications, Codes, Systems and Graphical Models, pp.113-130, 1999.

A. J. Menezes, Applications of Finite Fields, 1993.

M. Marazin, R. Gautier, and G. Burel, Blind recovery of the second convolutional encoder of a turbo-code when its systematic outputs are punctured, MTA, issue.2, pp.213-232, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00395172

M. Marazin, R. Gautier, and G. Burel, Dual code method for blind identification of convolutional encoder for cognitive radio receiver design, IEEE GLOBECOM Workshops, 2009.
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, issue.168, pp.1-9, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00665726

D. J. Mackay and R. M. Neal, Near shannon limit performance of low density parity check codes, Electron. Lett, vol.32, issue.18, pp.1645-1646, 1996.

E. Martinez-moro, Algebraic Geometry Modeling in Information Theory. World Scientific, 2012.

G. Planquette, Identification de trains binaires codés, 1996.

O. Pretzel, Error-correcting codes and finite fields, 1992.

G. John and . Proakis, Digital communications, 2001.

T. R. Rao, Arithmetic of finite fields, IEEE 5th Symposium on Computer Arithmetic (ARITH), pp.146-149, 1981.

I. Reed, A class of multiple-error-correcting codes and the decoding scheme, IEEE Transactions on Information Theory, vol.4, issue.4, pp.38-49, 1954.

B. Rice, Determining parameters of a rate 1/n convolutional encoder over gf(q)

, Proceedings of 3-rd International Conference on Finite Fields and Applications, 1995.

T. Richardson, Error floors of ldpc codes, Proc. 41st Annual Allerton Conf on Communications Control and Computing, 2003.

R. William and L. Shu, Channel Codes : Classical and Modern, 2009.

I. S. Reed and G. Solomon, Polynomial codes over certain finite fields

I. Reed and G. Solomon, Polynomial codes over certain finite fields, Journal of the Society of Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960.

T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, vol.47, pp.619-637, 2001.

W. E. Ryan and S. G. Wilson, Convolutional codes over GF(q) with applications to frequency-hopping channels, MILCOM, p.72, 1987.

W. E. Ryan and S. G. Wilson, Two classes of convolutional codes over GF(q) for q-ary orthogonalsignaling, IEEE Transactions on Communications, vol.39, p.30, 1991.

W. E. Ryan, Two classes of convolutional codes over gf(q) for q -ary orthogonal signaling, IEEE Transactions on Communications, vol.39, issue.1, pp.30-40, 1991.

Y. Sato, A method of self-recovering equalization for multilevel amplitude-modulation systems, IEEE Transactions on Communications, vol.23, issue.6, pp.679-682, 1975.

V. K. Bhargava-stephen and B. Wicker, Reed-Solomon Codes and Their Applications, 1994.

D. Sridhara and T. E. Fuja, Low density parity check codes defined over groups and rings, proc. of Information Theory Workshop (ITW), 2002.

G. Sicot and S. Houcke, Blind detection of interleaver parameters, IEEE International Conference on Acoustics, Speech and Signal Processing, vol.3, pp.829-832, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02125284

C. E. Shannon, A mathematical theory of communication, Bell system technical journal, vol.27, pp.623-656, 1948.

B. Shams, Les Codes LDPC non-binaires de nouvelle génération, 2010.

M. Soleymani and F. Shayegh, Efficient iterative techniques for soft decision decoding of reed-solomon codes, IEEE Transactions on Communications, vol.59, issue.2, pp.428-436, 2011.

G. Sicot, S. Houcke, and J. Barbier, Blind detection of interleaver parameters, Signal Processing, vol.89, issue.4, pp.450-462, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02125284

E. Savas¸andç and . Kaya-koç, Finite field arithmetic for cryptography, IEEE Circuits and Systems Magazine, vol.10, issue.2, pp.40-56, 2010.

J. Stern, A method for finding codewords of small weight, Coding Theory and Applications, vol.388, pp.106-113, 1989.

R. M. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, pp.533-547, 1981.

, Error Correction Coding : Mathematical Methods and Algorithms, 2005.

P. K. Vittahaladevuni and M. Alouini, Effect of imperfect phase and timing synchronization on the bit-error rate performance of psk modulations, IEEE Transactions on Communications, vol.53, issue.7, pp.1096-1099, 2005.

A. Valambois, Décodage, détection et reconnaissance des codes linéaires binaires, 2000.

A. Valembois, Detection and recognition of a binary linear code, Discrete Applied Mathematics, vol.111, issue.1-2, pp.199-218, 2001.

B. Vasic, Structured iteratively decodable codes based on steiner systems and their application in magnetic recording, IEEE Global Telecommunications Conference, 2001. GLOBECOM '01, vol.5, pp.2954-2960, 2001.

B. Vasic, Combinatorial constructions of low-density parity check codes for iterative decoding, Proceedings IEEE International Symposium on Information Theory, p.312, 2002.

A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, Low-complexity decoding for non-binary LDPC codes in high order fields, IEEE Transactions on Communications, vol.58, issue.5, pp.1365-1375, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00521074

A. J. 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.

]. J. Xcd-+-07, L. Xu, I. Chen, S. Djurdjevic, K. Lin et al., Construction of regular and irregular LDPC codes : Geometry decomposition and masking, IEEE Transactions on Information Theory, vol.53, issue.1, pp.121-134, 2007.

X. Zhang and F. Cai, Reduced-complexity decoder architecture for non-binary LDPC codes, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.19, issue.7, pp.1229-1238, 2011.

]. Y. Zgm-+-12a, R. Zrelli, M. Gautier, E. Marazin, E. Rannou et al., Focus on theoretical properties of blind convolutional codes identification methods based on rank criterion, MTA Review, vol.XXII, issue.4, pp.213-234, 2012.

[. Zgm-+-12b, ]. Y. Zrelli, R. Gautier, M. Marazin, E. Rannou et al., 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.

Y. Zrelli, M. Marazin, R. Gautier, and E. Rannou, Blind identification of convolutional encoder parameters over GF(2 m ) in the noiseless case, Proceedings of the International Conference on Computer Communication Networks, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00666183

?. 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, MTA Review, XXII, issue.4, pp.213-234, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00812412

, Communications avec actes dans un congrés international

?. Y. Zrelli, R. Gautier, M. Marazin, and E. Rannou, Blind identification of convolutional encoder parameters over GF(2m) in the noiseless case, IEEE ICCCN, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00666183

?. Y. Zrelli, S. Houcke, C. Langlais, and M. Ammar, Blind CFO estimation for OFDM-IDMA system in Rayleigh fading multipath channel, 2nd International Conference on Information Processing and Wireless Systems (IP-WiS), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00737424

?. 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, special session of Blind Identification Methods for Military Communications and Cognitive Radio Applications for 9th IEEE Communications Conference, p.Roumanie, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00812412

?. Y. Communications, R. Zrelli, M. Gautier, E. Marazin, E. Radoi et al., Identification aveugle des paramètres des codes convolutifs non-binaires, Journées Codage et Cryptographie, 2011.

?. Y. Zrelli, R. Gautier, M. Marazin, and E. Radoi, Nouvelle méthode robuste d'identification aveugle de la taille des mots de code pour une transmission entachée d'erreurs avec générali-sation aux codes correcteurs d'erreurs non-binaires, GRETSI, 2013.

?. Y. Zrelli, R. Gautier, E. Rannou, M. Marazin, and E. Radoi, Blind Identification of Codewords Size for Non-binary Error Correcting Codes in Noisy Transmission, Eurasip Journal on Wireless Communications and Networking