{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:36:13Z","timestamp":1781714173798,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00200-019-00392-0","type":"journal-article","created":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T19:03:25Z","timestamp":1561575805000},"page":"23-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Properties of syndrome distribution for blind reconstruction of cyclic codes"],"prefix":"10.1007","volume":"31","author":[{"given":"Arti D.","family":"Yardi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saravanan","family":"Vijayakumaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"392_CR1","doi-asserted-by":"crossref","unstructured":"Barbier, J., Letessier, J.: Forward error correcting codes characterization based on rank properties. In: IEEE WCSP, pp. 1\u20135. Nanjing, China (2009)","DOI":"10.1109\/WCSP.2009.5371733"},{"key":"392_CR2","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"392_CR3","doi-asserted-by":"publisher","first-page":"2572","DOI":"10.1109\/TSP.2018.2816587","volume":"66","author":"A Bonvard","year":"2018","unstructured":"Bonvard, A., Houcke, S., Gautier, R., Marazin, M.: Classification based on Euclidean distance distribution for blind identification of error correcting codes in noncooperative contexts. IEEE Trans. Signal Process. 66(10), 2572\u20132583 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"392_CR4","unstructured":"Burel, G., Gautier, R.: Blind estimation of encoder and interleaver characteristics in a non cooperative context. In: Proceedings of the IASTED. Scottsdale, USA (2003)"},{"issue":"1","key":"392_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\u20133","key":"392_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s10623-018-00593-7","volume":"87","author":"K Carrier","year":"2019","unstructured":"Carrier, K., Tillich, J.P.: Identifying an unknown code by partial Gaussian elimination. Design Code Cryptogr 87(2\u20133), 685\u2013713 (2019)","journal-title":"Design Code Cryptogr"},{"key":"392_CR7","doi-asserted-by":"crossref","unstructured":"Chabot, C.: Recognition of a code in a noisy environment. In: Proceedings of IEEE International Symposium on Information Theory, pp. 2211\u20132215. Nice, France (2007)","DOI":"10.1109\/ISIT.2007.4557548"},{"key":"392_CR8","unstructured":"Chabot, C.: Reconnaissance de codes, structure des codes quasi-cycliques. PhD thesis, University of Limoges (2009)"},{"key":"392_CR9","doi-asserted-by":"crossref","unstructured":"Cluzeau, M.: Block code reconstruction using iterative decoding techniques. In: Proceedings of International Symposium on Information Theory, pp. 2269\u20132273. Seattle, USA (2006)","DOI":"10.1109\/ISIT.2006.261971"},{"key":"392_CR10","doi-asserted-by":"crossref","unstructured":"Cluzeau, M., Finiasz, M.: Recovering a code\u2019s length and synchronization from a noisy intercepted bitstream. In: Proceedings of IEEE International Symposium on Information Theory, pp. 2737\u20132741. Seoul, Korea (2009)","DOI":"10.1109\/ISIT.2009.5205843"},{"key":"392_CR11","doi-asserted-by":"crossref","unstructured":"C\u00f4te, M., Sendrier, N.: Reconstruction of a turbo-code interleaver from noisy observation. In: Proceedings of IEEE International Symposium on Information Theory, pp. 2003\u20132007. Austin, Texas (2010)","DOI":"10.1109\/ISIT.2010.5513364"},{"key":"392_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"392_CR13","doi-asserted-by":"crossref","unstructured":"Dingel, J., Hagenauer, J.: Parameter estimation of a convolutional encoder from noisy observations. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1776\u20131780. Nice, France (2007)","DOI":"10.1109\/ISIT.2007.4557147"},{"key":"392_CR14","first-page":"101","volume-title":"Cryptography and Coding","author":"E Filiol","year":"1997","unstructured":"Filiol, E.: Reconstruction of convolutional encoders over GF(q). In: Darnell, M. (ed.) Cryptography and Coding, vol. 1335, pp. 101\u2013109. Springer, Berlin (1997)"},{"key":"392_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W Huffman","year":"2003","unstructured":"Huffman, W., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"issue":"5","key":"392_CR16","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1109\/LCOMM.2018.2806482","volume":"22","author":"D Jo","year":"2018","unstructured":"Jo, D., Kwon, S., Shin, D.: Blind reconstruction of BCH codes based on consecutive roots of generator polynomials. IEEE Commun. Lett. 22(5), 894\u2013897 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"392_CR17","unstructured":"Lee, H., Park, C., Lee, J., Song, Y.: Reconstruction of BCH codes using probability compensation. In: Proceedings of IEEE APCC, pp. 591\u2013594. Jeju Island, Korea (2012)"},{"key":"392_CR18","volume-title":"Introduction to Finite Fields and Their Applications","author":"R Lidl","year":"1986","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)"},{"key":"392_CR19","volume-title":"Error Control Coding","author":"S Lin","year":"2004","unstructured":"Lin, S., Costello, D.: Error Control Coding, 2nd edn. Prentice-Hall, Englewood Cliffs (2004)","edition":"2"},{"key":"392_CR20","volume-title":"The Theory of Error Correcting Codes","author":"F MacWilliams","year":"1977","unstructured":"MacWilliams, F., Sloane, N.: The Theory of Error Correcting Codes. North-Holland Publishing Company, Amsterdam (1977)"},{"key":"392_CR21","first-page":"1","volume":"1","author":"M Marazin","year":"2011","unstructured":"Marazin, M., Gautier, R., Burel, G.: Blind recovery of $$k\/n$$ rate convolutional encoders in a noisy environment. EURASIP J. Wirel. Commun. Netw. 1, 1\u20139 (2011)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"issue":"5","key":"392_CR22","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TCOMM.2014.050614.130297","volume":"62","author":"R Moosavi","year":"2014","unstructured":"Moosavi, R., Larsson, E.: Fast blind recognition of channel codes. IEEE Trans. Commun. 62(5), 1393\u20131405 (2014)","journal-title":"IEEE Trans. Commun."},{"key":"392_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/9780511982170","volume-title":"Codes, Cryptology and Curves with Computer Algebra","author":"R Pellikaan","year":"2017","unstructured":"Pellikaan, R., Wu, X.W., Bulygin, S., Jurrius, R.: Codes, Cryptology and Curves with Computer Algebra, vol. 1. Cambridge University Press, Cambridge (2017)"},{"key":"392_CR24","unstructured":"Rice, B.: Determining the parameters of a rate 1\/n convolutional encoder over GF(q). In: Proceedings of 3rd International Conference on Finite Fields and Applications. Glasgow, Scotland (1995)"},{"issue":"4","key":"392_CR25","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":"1","key":"392_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TIT.1967.1053953","volume":"13","author":"D Sullivan","year":"1967","unstructured":"Sullivan, D.: A fundamental inequality between the probabilities of binary subgroups and cosets. IEEE Trans. Inf. Theory 13(1), 91\u201394 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"392_CR27","doi-asserted-by":"crossref","unstructured":"Swaminathan, R., Madhukumar, A., Wang, G., Shang\u00a0Kee, T.: Blind reconstruction of Reed-Solomon encoder and interleavers over noisy environment. IEEE Trans. Broadcast., pp. 1\u201316 (2018)","DOI":"10.1109\/TBC.2018.2795461"},{"key":"392_CR28","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. Discrete Appl. Math. 111, 199\u2013218 (2001)","journal-title":"Discrete Appl. Math."},{"key":"392_CR29","doi-asserted-by":"crossref","unstructured":"Yardi, A.: Blind reconstruction of cyclic codes over binary erasure channel. In: Proceedings of IEEE International Symposium on Information Theory and Its Applications, pp. 301\u2013305. Singapore (2018)","DOI":"10.23919\/ISITA.2018.8664357"},{"key":"392_CR30","unstructured":"Yardi, A., Vijayakumaran, S., Kumar, A.: Blind reconstruction of binary cyclic codes. In: Proceedings of European Wireless, pp. 849\u2013854. Barcelona, Spain (2014)"},{"issue":"7","key":"392_CR31","doi-asserted-by":"publisher","first-page":"2693","DOI":"10.1109\/TCOMM.2016.2561931","volume":"64","author":"A Yardi","year":"2016","unstructured":"Yardi, A., Vijayakumaran, S., Kumar, A.: Blind reconstruction of binary cyclic codes from unsynchronized bitstream. IEEE Trans. Commun. 64(7), 2693\u20132706 (2016)","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"392_CR32","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.3390\/e15051705","volume":"15","author":"J Zhou","year":"2013","unstructured":"Zhou, J., Huang, Z., Liu, C., Su, S., Zhang, Y.: Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations. Entropy 15(5), 1705\u20131725 (2013)","journal-title":"Entropy"},{"issue":"1","key":"392_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1687-1499-2013-1","volume":"2013","author":"J Zhou","year":"2013","unstructured":"Zhou, J., Huang, Z., Su, S., Shaowu, Y.: Blind recognition of binary cyclic codes. EURASIP J. Wirel. Commun. Netw. 2013(1), 1\u201317 (2013)","journal-title":"EURASIP J. Wirel. Commun. Netw."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00392-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-019-00392-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00392-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T23:05:31Z","timestamp":1593039931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-019-00392-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,26]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s00200-019-00392-0","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,26]]},"assertion":[{"value":"5 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}