{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:56:09Z","timestamp":1773248169324,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In cognitive radio context, the parameters of coding schemes are unknown at the receiver. The design of an intelligent receiver is then essential to blindly identify these parameters from the received data. The blind identification of code word length has already been extensively studied in the case of binary error-correcting codes. Here, we are interested in non-binary codes where a noisy transmission environment is considered. To deal with the blind identification problem of code word length, we propose a technique based on the Gauss-Jordan elimination in GF(<jats:italic>q<\/jats:italic>) (Galois field), with <jats:italic>q<\/jats:italic>=2<jats:sup>\n              <jats:italic>m<\/jats:italic>\n            <\/jats:sup>, where <jats:italic>m<\/jats:italic> is the number of bits per symbol. This proposed technique is based on the information provided by the arithmetic mean of the number of zeros in each column of these matrices. The robustness of our technique is studied for different code parameters and over different Galois fields.<\/jats:p>","DOI":"10.1186\/s13638-015-0294-5","type":"journal-article","created":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T11:45:32Z","timestamp":1425123932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Blind identification of code word length for non-binary error-correcting codes in noisy transmission"],"prefix":"10.1186","volume":"2015","author":[{"given":"Yasamine","family":"Zrelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Gautier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Rannou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e9lanie","family":"Marazin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuel","family":"Radoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,1]]},"reference":[{"key":"294_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"MC Davey","year":"1998","unstructured":"MC Davey, D MacKay, Low-density parity-check codes over GF(q). IEEE Commun. Lett. 2, 165\u2013167 (1998).","journal-title":"IEEE Commun. Lett."},{"key":"294_CR2","volume-title":"5th International Symposium on Turbo Codes and Related Topics","author":"JA Briffa","year":"2008","unstructured":"JA Briffa, HG Schaathun, in 5th International Symposium on Turbo Codes and Related Topics. Non-binary turbo codes and applications (IEEELausanne, 2008)."},{"issue":"4","key":"294_CR3","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D Declercq","year":"2007","unstructured":"D Declercq, M Fossorier, Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans. Commun. 55(4), 633\u2013643 (2007).","journal-title":"IEEE Trans. Commun."},{"key":"294_CR4","first-page":"70","volume-title":"Proceedings ITW","author":"L Barnault","year":"2003","unstructured":"L Barnault, D Declercq, in Proceedings ITW. Fast decoding algorithm for LDPC over GF(2\n                    q\n                  ) (IEEE,Paris, France, 2003), pp. 70\u201373."},{"issue":"5","key":"294_CR5","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1109\/TCOMM.2010.05.070096","volume":"58","author":"A Voicila","year":"2010","unstructured":"A Voicila, D Declercq, F Verdier, M Fossorier, P Urard, Low-complexity decoding for non-binary LDPC codes in high order fields. IEEE Trans. Commun. 58(5), 1365\u20131375 (2010).","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"294_CR6","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/LCOMM.2012.021612.112467","volume":"16","author":"Yang Yu","year":"2012","unstructured":"Yang Yu, W Chen, Design of low complexity non-binary LDPC codes with an approximated performance-complexity tradeoff. IEEE Commun. Lett. 16(4), 514\u2013517 (2012).","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"294_CR7","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/LCOMM.2013.051313.130462","volume":"17","author":"T Xia","year":"2013","unstructured":"T Xia, HC Wu, Identification of nonbinary LDPC codes using average LLR of syndrome a posteriori probability. IEEE Commun. Lett. 17(7), 1301\u20131304 (2013).","journal-title":"IEEE Commun. Lett."},{"key":"294_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume":"388","author":"J Stern","year":"1989","unstructured":"J Stern, A method for finding code words of small weight. Coding Theory Appl. 388, 106\u2013113 (1989).","journal-title":"Coding Theory Appl."},{"key":"294_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"A Canteaut, F Chabaud, 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 Trans. Inf. Theory. 44, 367\u2013378 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-2","key":"294_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00353-X","volume":"111","author":"A Valembois","year":"2001","unstructured":"A Valembois, Detection and recognition of a binary linear code. Discrete Appl. Math. 111(1-2), 199\u2013218 (2001).","journal-title":"Discrete Appl. Math."},{"key":"294_CR11","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1109\/ISIT.2006.261971","volume-title":"2006 IEEE International Symposium on Information Theory","author":"M Cluzeau","year":"2006","unstructured":"M Cluzeau, in 2006 IEEE International Symposium on Information Theory. Block code reconstruction using iterative decoding techniques (IEEE,Seattle, WA, 2006), pp. 2269\u20132273."},{"key":"294_CR12","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1109\/ISIT.2009.5205843","volume-title":"IEEE International Symposium on Information Theory 2009","author":"M Cluzeau","year":"2009","unstructured":"M Cluzeau, M Finiasz, in IEEE International Symposium on Information Theory 2009. Recovering a code\u2019s length and synchronization from a noisy intercepted bitstream (IEEE,Seoul, 2009), pp. 2737\u20132741."},{"key":"294_CR13","first-page":"546","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"M C\u00f4te","year":"2009","unstructured":"M C\u00f4te, N Sendrier, in IEEE International Symposium on Information Theory (ISIT). Reconstruction of convolutional codes from noisy observation (IEEE,Seoul, 2009), pp. 546\u2013550."},{"key":"294_CR14","volume-title":"IASTED International Conference on Communications, Internet and Information Technology","author":"G Burel","year":"2003","unstructured":"G Burel, R Gautier, in IASTED International Conference on Communications, Internet and Information Technology. Blind estimation of encoder and interleaver characteristics in a non cooperative context (ACTA Press,Scottsdale, AZ, USA, 2003)."},{"issue":"4","key":"294_CR15","first-page":"213","volume":"XXII","author":"Y Zrelli","year":"2012","unstructured":"Y Zrelli, R Gautier, M Marazin, E Rannou, E Radoi, Focus on theoretical properties of blind convolutional codes identification methods based on rank criterion. MTA Review. XXII(4), 213\u2013234 (2012).","journal-title":"MTA Review"},{"key":"294_CR16","volume-title":"Proceedings of the International Conference on Computer Communication Networks","author":"Y Zrelli","year":"2011","unstructured":"Y Zrelli, M Marazin, R Gautier, E Rannou, in Proceedings of the International Conference on Computer Communication Networks. Blind identification of convolutional encoder parameters over GF(2\n                    m\n                  ) in the noiseless case (IEEE,Maui, Hawaii, 2011)."},{"key":"294_CR17","first-page":"829","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol. 3","author":"G Sicot","year":"2005","unstructured":"G Sicot, S Houcke, in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol. 3. Blind detection of interleaver parameters (IEEE,Philadelphia, Pennsylvania, 2005), pp. 829\u2013832."},{"issue":"4","key":"294_CR18","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.sigpro.2008.09.012","volume":"89","author":"G Sicot","year":"2009","unstructured":"G Sicot, S Houcke, J Barbier, Blind detection of interleaver parameters. Signal Process. 89(4), 450\u2013462 (2009).","journal-title":"Signal Process."},{"issue":"168","key":"294_CR19","first-page":"1","volume":"2011","author":"M Marazin","year":"2011","unstructured":"M Marazin, R Gautier, G Burel, Blind recovery of k\/n rate convolutional encoders in a noisy environment. EURASIP J. Wireless Commun. Netw. 2011(168), 1\u20139 (2011).","journal-title":"EURASIP J. Wireless Commun. Netw."},{"issue":"5","key":"294_CR20","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.3390\/e15051705","volume":"15","author":"Z Jing","year":"2013","unstructured":"Z Jing, H Zhiping, L Chunwu, S Shaojing, Z Yimeng, Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations. Entropy. 15(5), 1705\u20131725 (2013).","journal-title":"Entropy"},{"key":"294_CR21","first-page":"147","volume":"2","author":"A Hocquenghem","year":"1959","unstructured":"A Hocquenghem, Codes correcteurs d\u2019erreurs. Chiffres. 2, 147\u2013156 (1959).","journal-title":"Chiffres"},{"issue":"3","key":"294_CR22","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(60)90287-4","volume":"3","author":"RC Bose","year":"1960","unstructured":"RC Bose, DK Ray-Chaudhuri, On a class of error correcting binary group codes. Inf. Control. 3(3), 68\u201379 (1960).","journal-title":"Inf. Control"},{"issue":"2","key":"294_CR23","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I Reed","year":"1960","unstructured":"I Reed, G Solomon, Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960).","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"294_CR24","first-page":"1220","volume-title":"2013 IEEE Military Communications Conference","author":"M Baldi","year":"2013","unstructured":"M Baldi, M Bianchi, F Chiaraluce, R Garello, N Maturo, IA Sanchez, S Cioni, in 2013 IEEE Military Communications Conference. Advanced coding schemes against jamming in telecommand links (IEEE,San Diego, CA, 2013), pp. 1220\u20131226."},{"key":"294_CR25","first-page":"1","volume-title":"International Conference on Communications, Circuits and Systems","author":"C Junbin","year":"2005","unstructured":"C Junbin, W Lin, L Yong, in International Conference on Communications, Circuits and Systems, 1. Performance comparison between non-binary LDPC codes and Reed-Solomon codes over noise bursts channels (IEEE,Hong Kong, China, 2005), pp. 1\u20134."},{"key":"294_CR26","first-page":"175","volume-title":"Information Theory and Applications Workshop","author":"B Zhou","year":"2008","unstructured":"B Zhou, L Zhang, J Kang, Q Huang, YY Tai, S Lin, M Xu, in Information Theory and Applications Workshop. Non-binary LDPC codes vs. Reed-Solomon codes (IEEE,San Diego, CA, 2008), pp. 175\u2013184."},{"key":"294_CR27","unstructured":"version 8.8.0 Release 8 GT, LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding. The 3rd Generation Partnership Project 2, Technical Specification Group Radio Access Network (2010). http:\/\/www.3gpp.org. (2013)."},{"key":"294_CR28","volume-title":"IEEE GLOBECOM Workshops","author":"M Marazin","year":"2009","unstructured":"M Marazin, R Gautier, G Burel, in IEEE GLOBECOM Workshops. Dual code method for blind identification of convolutional encoder for cognitive radio receiver design (IEEE,Honolulu, HI, 2009)."},{"key":"294_CR29","volume-title":"Algebraic geometry modeling in information theory","author":"EM Moro","year":"2012","unstructured":"EM Moro, Algebraic geometry modeling in information theory (World Scientific, Singapore, 2012)."},{"key":"294_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK user\u2019s guide","author":"E Anderson","year":"1999","unstructured":"E Anderson, Z Bai, C Bischof, S Blackford, J Demmel, J Dongarra, JD Croz, A Greenbaum, S Hammarling, A McKenney, D Sorensen, LAPACK user\u2019s guide (SIAM, Philadelphia, 1999)."},{"key":"294_CR31","volume-title":"Identification aveugle de codes correcteurs d\u2019erreurs bas\u00e9s sur des grands corps de Galois et recherche d\u2019algorithmes de type d\u00e9cision souple pour les codes convolutifs","author":"Y Zrelli","year":"2013","unstructured":"Y Zrelli, Identification aveugle de codes correcteurs d\u2019erreurs bas\u00e9s sur des grands corps de Galois et recherche d\u2019algorithmes de type d\u00e9cision souple pour les codes convolutifs (PhD thesis, Universit\u00e9 de Brest, France, 2013)."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0294-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-015-0294-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0294-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0294-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T09:07:15Z","timestamp":1630573635000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-015-0294-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1186\/s13638-015-0294-5","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,1]]},"assertion":[{"value":"12 February 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"43"}}