{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:31:31Z","timestamp":1772724691450,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10623-018-00593-7","type":"journal-article","created":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T08:10:22Z","timestamp":1545379822000},"page":"685-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Identifying an unknown code by partial Gaussian elimination"],"prefix":"10.1007","volume":"87","author":[{"given":"Kevin","family":"Carrier","sequence":"first","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"issue":"1","key":"593_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A., Indyk P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008).","journal-title":"Commun. ACM"},{"key":"593_CR2","unstructured":"Andoni A., Indyk P.: Nearest neighbors in high-dimensional spaces. In: Goodman J.E., O\u2019Rourke J., T\u00f3th C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn, ch. 43. CRC Press, Boca Ratin (2017)."},{"key":"593_CR3","unstructured":"Andoni A., Indyk P., Nguyen H.L., Razenshteyn I.: Beyond locality-sensitive hashing. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, PA, USA), SODA \u201914, Society for Industrial and Applied Mathematics, pp. 1018\u20131028 (2014)."},{"key":"593_CR4","unstructured":"Andoni A., Razenshteyn I.P.: Optimal data-dependent hashing for approximate near neighbors. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, pp. 793\u2013801 (2015)."},{"key":"593_CR5","unstructured":"Barbero \u00c1.I., Ytrehus \u00d8.: Modifications of the rao-nam cryptosystem. In: Buchmann J., H\u00f8holdt T., Stichtenoth H., Tapia-Recillas H., (eds.) Coding Theory, Cryptography and Related Areas: Proceedings of an International Conference on Coding Theory, Cryptography and Related Areas, held in Guanajuato, Mexico, in April 1998. Springer, Berlin, pp. 1\u201312 (2000)."},{"key":"593_CR6","unstructured":"Barbier J.: Reconstruction of turbo-code encoders. In: Proceedings of SPIE, vol. 5819, pp. 463\u2013473 (2005)."},{"key":"593_CR7","unstructured":"Barbier J.: Analyse de canaux de communication dans un contexte non coop\u00e9ratif. PhD thesis, \u00c9cole Polytechnique (2007)."},{"key":"593_CR8","unstructured":"Barbier J., Sicot G., Houcke S.: Algebraic approach of the reconstruction of linear and convolutional error correcting codes. In: World Academy of Science, Engineering and Technology, vol. 16, pp. 66\u201371 (2006)."},{"key":"593_CR9","unstructured":"Becker A., Ducas L., Gama N., Laarhoven T.: New directions in nearest neighbor searching with applications to lattice sieving. IACR Cryptology ePrint Archive, Report 2015\/1128 (2015). \n                    http:\/\/eprint.iacr.org\/2015\/1128\n                    \n                  ."},{"key":"593_CR10","unstructured":"Bellard M., Tillich J.-P.: Detecting and reconstructing an unknown convolutional code by counting collisions. In: Proceedings of IEEE International Symposium on Information Theory\u2014ISIT (Honolulu, Hawaii, USA), pp. 2967\u20132971 (2014)."},{"key":"593_CR11","unstructured":"Both L., May A.: Optimizing BJMM with nearest neighbors: full decoding in \n                    \n                      \n                    \n                    $$2^{2\/21 n}$$\n                    \n                      \n                        \n                          2\n                          \n                            2\n                            \/\n                            21\n                            n\n                          \n                        \n                      \n                    \n                   and McEliece security. In: WCC workshop on coding and cryptography (2017). \n                    http:\/\/wcc2017.suai.ru\/Proceedings_WCC2017.zip\n                    \n                  ."},{"key":"593_CR12","unstructured":"Both L., May A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange T., Steinwandt R. (eds.) Post-quantum cryptography 2018 (Fort Lauderdale, FL, USA), vol. 10786, pp. 25\u201346. LNCS. Springer, Berlin (2018)."},{"issue":"4","key":"593_CR13","doi-asserted-by":"publisher","first-page":"2406","DOI":"10.1109\/TIT.2011.2177808","volume":"58","author":"J Bringer","year":"2012","unstructured":"Bringer J., Chabanne H.: Code reverse engineering problem for identification codes. IEEE Trans. Inf. Theory 58(4), 2406\u20132412 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"593_CR14","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TIT.2004.828064","volume":"50","author":"D Burshtein","year":"2004","unstructured":"Burshtein D., Miller G.: Asymptotic enumeration methods for analyzing LDPC codes. IEEE Trans. Inf. Theory 50(6), 1115\u20131131 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"593_CR15","unstructured":"Chabot C.: Reconstruction of families of codes. application to cyclic codes. In: Workshop on Coding and Cryptography (WCC) (Ullensvang, Norway) (2009)."},{"key":"593_CR16","doi-asserted-by":"crossref","unstructured":"Cluzeau M., Finiasz M.: Reconstruction of punctured convolutional codes. In: IEEE Information Theory Workshop (ITW) (Taormina, Italy) (2009).","DOI":"10.1109\/ITW.2009.5351168"},{"key":"593_CR17","unstructured":"Cluzeau M., Finiasz M.: Recovering a code\u2019s length and synchronization from a noisy intercepted bitstream. In: Proceedings of IEEE International Symposium Information Theory\u2014ISIT (Seoul, Korea), pp. 2737\u20132741 (2009)."},{"key":"593_CR18","unstructured":"Cluzeau M., Tillich J.-P.: On the code reverse engineering problem. In Proceedings of IEEE International Symposium Information Theory\u2014ISIT (Toronto, Canada), pp. 634\u2013638 (2008)."},{"key":"593_CR19","unstructured":"Cluzeau M., Finiasz M., Tillich J.-P.: Methods for the Reconstruction of Parallel Turbo Codes. In: Proceedings of IEEE International Symposium Information Theory\u2014ISIT (Austin, Texas, USA), pp. 2008\u20132012 (2010)."},{"key":"593_CR20","unstructured":"C\u00f4te M., Sendrier,N.: Reconstruction of convolutional codes from noisy observation. In Proceedings of IEEE International Symposium Information Theory\u2014ISIT (Seoul, Korea), pp. 546\u2013550 (2009)."},{"key":"593_CR21","unstructured":"C\u00f4te M., Sendrier N.: Reconstruction of a turbo-code interleaver from noisy observation. In: Proceedings of IEEE International Symposium Information Theory\u2014ISIT (Austin, Texas, USA), pp. 2003\u20132007 (2010)."},{"key":"593_CR22","unstructured":"Deshpande A.J.: Sampling-based algorithms for dimension reduction. PhD thesis, Massachusetts Institute of Technology (2007)."},{"issue":"11","key":"593_CR23","doi-asserted-by":"publisher","first-page":"4839","DOI":"10.1109\/TIT.2006.883541","volume":"52","author":"C Di","year":"2006","unstructured":"Di C., Richardson T., Urbanke R.: Weight distribution of low-density parity-check codes. IEEE Trans. Inf. Theory 52(11), 4839\u20134855 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"593_CR24","unstructured":"Dingel J., Hagenauer J.: Parameter estimation of a convolutional encoder from noisy observation. In: Proceedings of IEEE International Symposium on Information Theory\u2014ISIT (Nice, France, June 2007), pp. 1776\u20131780 (2007)."},{"issue":"8","key":"593_CR25","doi-asserted-by":"publisher","first-page":"4166","DOI":"10.1109\/TIT.2010.2050814","volume":"56","author":"M Dubiner","year":"2010","unstructured":"Dubiner M.: Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem. IEEE Trans. Inf. Theory 56(8), 4166\u20134179 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"593_CR26","unstructured":"Dumer I.: On minimum distance decoding of linear codes. In: Proceedings of 5th Joint Soviet-Swedish International Workshop Information Theory (Moscow), pp. 50\u201352 (1991)."},{"issue":"14","key":"593_CR27","doi-asserted-by":"publisher","first-page":"2556","DOI":"10.1049\/iet-com.2014.0101","volume":"8","author":"M Esmaeili","year":"2014","unstructured":"Esmaeili M., Dakhilalian M., Gulliver T.A.: New secure channel coding scheme based on randomly punctured quasi-cyclic-low density parity check codes. IET Commun. 8(14), 2556\u20132562 (2014).","journal-title":"IET Commun."},{"key":"593_CR28","doi-asserted-by":"crossref","unstructured":"Filiol E.: Reconstruction of convolutional encoders over \n                    \n                      \n                    \n                    $$GF(q)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          q\n                          )\n                        \n                      \n                    \n                  . In: Cryptography and Coding: 6th IMA International Conference, pp. 101\u2013109 (1997).","DOI":"10.1007\/BFb0024454"},{"key":"593_CR29","unstructured":"Filiol E.: Reconstruction of punctured convolutional encoders. In: Proceedings of IEEE International Symposium on Information Theory and Applications (ISITA) (2000)."},{"issue":"2","key":"593_CR30","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/18.910573","volume":"47","author":"GDJ Forney","year":"2001","unstructured":"Forney G.D.J.: Codes on graphs: normal realizations. IEEE Trans. Inf. Theory 47(2), 520\u2013548 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"593_CR31","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager R.G.: Low Density Parity Check Codes. M.I.T. Press, Cambridge, Massachusetts (1963)."},{"key":"593_CR32","unstructured":"Gionis A., Indyk P., Motwani R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th VLDB Conference, pp. 518\u2013529 (1999)."},{"issue":"3","key":"593_CR33","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/TIT.2009.2039037","volume":"56","author":"DM Gordon","year":"2010","unstructured":"Gordon D.M., Miller V.S., Ostapenko P.: Optimal hash functions for approximate matches on the \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -cube. IEEE Trans. Inf. Theory 56(3), 984\u2013991 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"14","key":"593_CR34","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled S., Indyk P., Motwani R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8(14), 321\u2013350 (2012).","journal-title":"Theory Comput."},{"key":"593_CR35","unstructured":"Indyk P., Motwani R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (New York, NY, USA), STOC \u201998, ACM, pp. 604\u2013613 (1998)."},{"key":"593_CR36","unstructured":"Lu P., Shen L., Luo X., Zou Y.: Blind recognition of punctured convolutional codes. In: Proceedings of IEEE International Symposium on Information Theory\u2014ISIT (Chicago, USA), p. 457 (2004)."},{"key":"593_CR37","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986).","edition":"5"},{"issue":"2","key":"593_CR38","first-page":"13","volume":"9","author":"B Mafakheri","year":"2017","unstructured":"Mafakheri B., Eghlidos T., Pilaram H.: An efficient secure channel coding scheme based on polar codes. ISC Int. J. Inf. Secur. 9(2), 13\u201320 (2017).","journal-title":"ISC Int. J. Inf. Secur."},{"key":"593_CR39","unstructured":"Marazin M.: Reconnaissance en aveugle de codeur \u00e0 base de code convolutif: contribution \u00e0 la mise en oeuvre d\u2019un r\u00e9cepteur intelligent. PhD thesis, Universit\u00e9 de Bretagne Occidentale (2009)."},{"issue":"2","key":"593_CR40","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1049\/iet-spr.2010.0343","volume":"6","author":"M Marazin","year":"2012","unstructured":"Marazin M., Gautier R., Burel G.: Algebraic method for blind recovery of punctured convolutional encoders from an erroneous bitstream. IET Signal Process. 6(2), 122\u2013131 (2012).","journal-title":"IET Signal Process."},{"key":"593_CR41","unstructured":"Matsui M.: Linear cryptanalysis method for DES cipher. In: Proceedings of Advances in Cryptology\u2014EUROCRYPT \u201993, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23\u201327, 1993, vol. 765. Lecture Notes in Computer Science. Springer, pp. 386\u2013397 (1993)."},{"key":"593_CR42","unstructured":"May A., Ozerov I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald E., Fischlin M. (eds.) Advances in Cryptology\u2014EUROCRYPT 2015, vol. 9056, pp. 203\u2013228. LNCS. Springer, Berlin (2015)."},{"issue":"1","key":"593_CR43","first-page":"68","volume":"8","author":"A Naseri","year":"2011","unstructured":"Naseri A., Azmoon O., Fazeli S.: Blind recognition algorithm of turbo codes for communication intelligence systems. Int. J. Comput. Sci. Issues 8(1), 68\u201372 (2011).","journal-title":"Int. J. Comput. Sci. Issues"},{"key":"593_CR44","unstructured":"Rao T.R.N., Nam K.: Private-key algebraic-coded cryptosystems. In: Advances in cryptology\u2014CRYPTO\u201986, vol. 263, pp. 35\u201348. LNCS. Springer, Berlin (1986)."},{"key":"593_CR45","unstructured":"Rathi V.: On the asymptotic weight distribution of regular LDPC ensembles. In: IEEE Proceedings of International Symposium on Information Theory, 2005 (ISIT 2005), pp. 2161\u20132165 (2005)."},{"key":"593_CR46","unstructured":"Rice B.: Determining the parameters of a rate \n                    \n                      \n                    \n                    $$\\frac{1}{n}$$\n                    \n                      \n                        \n                          1\n                          n\n                        \n                      \n                    \n                   convolutional encoder over \n                    \n                      \n                    \n                    $${GF}(q)$$\n                    \n                      \n                        \n                          \n                            GF\n                          \n                          (\n                          q\n                          )\n                        \n                      \n                    \n                  . In: Third International Conference on Finite Fields and Applications (Glasgow, 1995)."},{"key":"593_CR47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T Richardson","year":"2008","unstructured":"Richardson T., Urbanke R.: Modern Coding Theory. Cambridge University Press, Cambridge (2008)."},{"issue":"1","key":"593_CR48","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MEMB.2006.1578665","volume":"25","author":"GL Rosen","year":"2006","unstructured":"Rosen G.L.: Examining coding structure and redundancy in DNA. IEEE Eng. Med. Biol. 25(1), 62\u201368 (2006).","journal-title":"IEEE Eng. Med. Biol."},{"issue":"4","key":"593_CR49","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.sigpro.2008.09.012","volume":"89","author":"G Sicot","year":"2009","unstructured":"Sicot G., Houcke S., Barbier J.: Blind detection of interleaver parameters. Signal Process. 89(4), 450\u2013462 (2009).","journal-title":"Signal Process."},{"issue":"2","key":"593_CR50","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1049\/iet-com:20080050","volume":"3","author":"AA Sobhi Afshar","year":"2009","unstructured":"Sobhi Afshar A.A., Eghlidos T., Aref M.R.: Efficient secure channel coding based on quasi-cyclic low-density parity-check codes. IET Commun. 3(2), 279\u2013292 (2009).","journal-title":"IET Commun."},{"key":"593_CR51","unstructured":"Struik R., Tilburg J.V.: The Rao-Nam scheme is insecure against a chosen-plaintext attack. In: Advances in Cryptology\u2014CRYPTO\u201987, vol. 293, pp. 445\u2013457. LNCS. Springer, Berlin (1987)."},{"key":"593_CR52","unstructured":"Tillich, J.-P., Tixier, A., Sendrier, N.: Recovering the interleaver of an unknown turbo-code. In: Proceedings of IEEE International Symposium Information Theory\u2014ISIT (Honolulu, Hawaii, USA), pp. 2784\u20132788 (2014)."},{"key":"593_CR53","unstructured":"Tixier A.: Blind identification of an unknown interleaved convolutional code. In: IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14\u201319, 2015, pp. 71\u201375 (2015)."},{"key":"593_CR54","doi-asserted-by":"crossref","unstructured":"Tixier A.: Blind identification of an unknown interleaved convolutional code. \n                    arXiv:1501.03715\n                    \n                   (2015).","DOI":"10.1109\/ISIT.2015.7282419"},{"key":"593_CR55","unstructured":"Tixier A.: Reconnaissance de codes correcteurs (Blind identification of error correcting codes). PhD thesis, Pierre and Marie Curie University, Paris, France (2015)."},{"key":"593_CR56","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00353-X","volume":"111","author":"A Valembois","year":"2001","unstructured":"Valembois A.: Detection and recognition of a binary linear code. Discret. Appl. Math. 111, 199\u2013218 (2001).","journal-title":"Discret. Appl. Math."},{"key":"593_CR57","unstructured":"Valiant L.G.: Graph-theoretic arguments in low-level complexity. In: Proceedings of Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5\u20139, 1977, vol. 53, pp. 162\u2013176. LNCS. Springer, Berlin (1977)."},{"key":"593_CR58","doi-asserted-by":"crossref","unstructured":"Wang J., Yue Y., Yao J.: A method of blind recognition of cyclic code generator polynomial. In: IEEE 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM) (2010).","DOI":"10.1109\/WICOM.2010.5600940"},{"key":"593_CR59","doi-asserted-by":"crossref","unstructured":"Wang L., Hu Y., Hao S., Qi L.: The method of estimating the length of linear cyclic code based on the distribution of code weight. In: IEEE 2nd International Conference on Information Science and Engineering (ICISE), pp. 2459\u20132462 (2010).","DOI":"10.1109\/ICISE.2010.5689035"},{"key":"593_CR60","unstructured":"Wang Z.H.F., Zhou Y.: A method for blind recognition of convolution code based on Euclidean algorithm. In: International Conference on Wireless Communications, Networking and Mobile Computing (Shanghai, China), pp. 1414\u20131417 (2007)."},{"key":"593_CR61","volume-title":"Generatingfunctioology","author":"H Wilf","year":"1994","unstructured":"Wilf H.: Generatingfunctioology, 2nd edn. Academic Press, Cambridge (1994).","edition":"2"},{"key":"593_CR62","unstructured":"Yardi A.-D., Vijayakumaran S., Kumar A.: Blind reconstruction of binary cyclic codes. In: Proceedings of the European Wireless 2014 (2014)."},{"key":"593_CR63","doi-asserted-by":"crossref","unstructured":"Zhou J., Huang Z., Su S., Yang S.: Blind recognition of binary cyclic codes. In: EURASIP Journal on Wireless Communications and Networking (2013).","DOI":"10.1186\/1687-1499-2013-218"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-00593-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-00593-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-00593-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:04:07Z","timestamp":1576886647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-00593-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"references-count":63,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-00593-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"24 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}