{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:29:21Z","timestamp":1648657761424},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540938057","type":"print"},{"value":"9783540938064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-93806-4_4","type":"book-chapter","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T23:17:38Z","timestamp":1242775058000},"page":"47-68","source":"Crossref","is-referenced-by-count":13,"title":["An Introduction to Linear and Cyclic Codes"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Augot","sequence":"first","affiliation":[]},{"given":"Emanuele","family":"Betti","sequence":"additional","affiliation":[]},{"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,21]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1109\/18.771141","volume":"45","author":"A.\u00a0M. Barg","year":"1999","unstructured":"A.\u00a0M. Barg, E. Krouk, and H.\u00a0C.\u00a0A. van\u00a0Tilborg, On the complexity of minimum distance decoding of long linear codes, IEEE Trans. on Inf. Th. 45 (1999), no.\u00a05, 1392\u20131405.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","volume":"52","author":"L.\u00a0M. Bazzi","year":"2006","unstructured":"L.\u00a0M. Bazzi and S.\u00a0K. Mitter, Some randomized code constructions from group actions, IEEE Trans. on Inf. Th. 52 (2006), 3210\u20133219.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR3","volume-title":"Algebraic coding theory","author":"E.\u00a0R. Berlekamp","year":"1968","unstructured":"E.\u00a0R. Berlekamp, Algebraic coding theory, McGraw\u2013Hill, New York, 1968."},{"key":"4_CR4","volume-title":"Algebraic coding theory (revised edition)","author":"E.\u00a0R. Berlekamp","year":"1984","unstructured":"E.\u00a0R. Berlekamp, Algebraic coding theory (revised edition), Aegean Park, Walnut Creek, 1984."},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E.\u00a0R. Berlekamp","year":"1978","unstructured":"E.\u00a0R. Berlekamp, R.\u00a0J. McEliece, and H.\u00a0C.\u00a0A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. on Inf. Th. 24 (1978), no.\u00a03, 384\u2013386.","journal-title":"IEEE Trans. on Inf. Th."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01119999","volume":"3","author":"S.\u00a0D. Berman","year":"1967","unstructured":"S.\u00a0D. Berman, Semisimple cyclic and Abelian codes. II, Cybernetics 3 (1967), no.\u00a03, 17\u201323.","journal-title":"Cybernetics"},{"key":"4_CR7","volume-title":"Theory and practice of error control codes","author":"R.\u00a0E. Blahut","year":"1983","unstructured":"R.\u00a0E. Blahut, Theory and practice of error control codes, Addison\u2013Wesley, Reading, 1983."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(60)90287-4","volume":"3","author":"R.\u00a0C. Bose","year":"1960","unstructured":"R.\u00a0C. Bose and D.\u00a0K. Ray-Chaudhuri, On a class of error correcting binary group codes, Information and Control 3 (1960), 68\u201379.","journal-title":"Information and Control"},{"key":"4_CR9","first-page":"371","volume-title":"Combinatorial mathematics and its application","author":"P. Camion","year":"1969","unstructured":"P. Camion, A proof of some properties of Reed\u2013Muller codes by means of the normal basis theorem, Combinatorial mathematics and its application, Univ. of North Carolina, Chapel\u00a0Hill, 1969, pp.\u00a0371\u2013376."},{"key":"4_CR10","first-page":"164","volume-title":"LNCS","author":"G. Castagnoli","year":"1989","unstructured":"G. Castagnoli, On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors, LNCS, vol. 357, Springer, Berlin, 1989, pp.\u00a0164\u2013168."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G. Castagnoli","year":"1991","unstructured":"G. Castagnoli, J.\u00a0L. Massey, P.\u00a0A. Schoeller, and N. von Seeman, On repeated-root cyclic codes, IEEE Trans. on Inf. Th. 37 (1991), 337\u2013342.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TIT.1964.1053699","volume":"10","author":"R.\u00a0T. Chien","year":"1964","unstructured":"R.\u00a0T. Chien, Cyclic decoding procedure for the Bose\u2013Chaudhuri\u2013Hocquenghem codes, IEEE Trans. on Inf. Th. 10 (1964), 357\u2013363.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TIT.1965.1053825","volume":"11","author":"G.\u00a0D. Forney","year":"1965","unstructured":"G.\u00a0D. Forney, On decoding BCH codes, IEEE Trans. on Inf. Th. 11 (1965), 549\u2013557.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"E. Guerrini and A. Rimoldi, FGLM-like decoding: from Fitzpatrick\u2019s approach to recent developments, this volume, 2009, pp.\u00a0197\u2013218.","DOI":"10.1007\/978-3-540-93806-4_12"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R.\u00a0W. Hamming","year":"1950","unstructured":"R.\u00a0W. Hamming, Error detecting and error correcting codes, Bell Systems Technical Journal 29 (1950), 147\u2013160.","journal-title":"Bell Systems Technical Journal"},{"key":"4_CR16","volume-title":"Coding theory: The essential","author":"D.\u00a0G. Hoffman","year":"1991","unstructured":"D.\u00a0G. Hoffman, Coding theory: The essential, Dekker, New York, 1991."},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J. Justensen","year":"1972","unstructured":"J. Justensen, A class of constructive asymptotically good algebraic codes, IEEE Trans. on Inf. Th. 18 (1972), no.\u00a05, 652\u2013656.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.1974.1055262","volume":"20","author":"T. Kasami","year":"1974","unstructured":"T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1\/2, IEEE Trans. on Inf. Th. 20 (1974), 679\u2013679.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR19","volume-title":"An introduction to error-correcting codes","author":"S. Lin","year":"1970","unstructured":"S. Lin, An introduction to error-correcting codes, Prentice Hall, New York, 1970."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0019-9958(67)90660-2","volume":"11","author":"S. Lin","year":"1967","unstructured":"S. Lin and E.\u00a0J. Weldon, Long BCH codes are bad, Information Control 11 (1967), 445\u2013451.","journal-title":"Information Control"},{"key":"4_CR21","volume-title":"The theory of error-correcting codes. I and II","author":"F.\u00a0J. MacWilliams","year":"1977","unstructured":"F.\u00a0J. MacWilliams and N.\u00a0J.\u00a0A. Sloane, The theory of error-correcting codes. I and II, North-Holland, Amsterdam, 1977."},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TIT.2005.862123","volume":"52","author":"C. Martinez-Perez","year":"2006","unstructured":"C. Martinez-Perez and W. Willems, Is the class of cyclic codes asymptotically good? IEEE Trans. on Inf. Th. 52 (2006), no.\u00a02, 696\u2013700.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.\u00a0L. Massey","year":"1969","unstructured":"J.\u00a0L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. on Inf. Th. 15 (1969), 122\u2013127.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"T. Mora and E. Orsini, Decoding cyclic codes: the Cooper philosophy, this volume, 2009, pp.\u00a069\u201391.","DOI":"10.1007\/978-3-540-93806-4_5"},{"key":"4_CR25","volume-title":"Error-correcting codes","author":"W.\u00a0W. Peterson","year":"1972","unstructured":"W.\u00a0W. Peterson and E.\u00a0J. Weldon Jr., Error-correcting codes, second ed., MIT Press, Cambridge, 1972.","edition":"2"},{"key":"4_CR26","volume-title":"Introduction to the theory of error-correcting codes","author":"V. Pless","year":"1982","unstructured":"V. Pless, Introduction to the theory of error-correcting codes, Wiley, New York, 1982."},{"key":"4_CR27","volume-title":"Handbook of coding theory, vols. I, II","year":"1998","unstructured":"V.\u00a0S. Pless, W.\u00a0C. Huffman, and R.\u00a0A. Brualdi (eds.), Handbook of coding theory, vols. I, II, North-Holland, Amsterdam, 1998."},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I.\u00a0S. Reed","year":"1960","unstructured":"I.\u00a0S. Reed and G. Solomon, Polynomial codes over certain finite fields, J. Soc. Indust. Appl. Math. 8 (1960), 300\u2013304.","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.\u00a0E. Shannon","year":"1948","unstructured":"C.\u00a0E. Shannon, A mathematical theory of communication, Bell System Tech. J. 27 (1948), 379\u2013423, 623\u2013656.","journal-title":"Bell System Tech. J."},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(75)90090-X","volume":"27","author":"Y. Sugiyama","year":"1975","unstructured":"Y. Sugiyama, S. Kasahara, S. Hirasawa, and T. Namekawa, A method for solving key equation for decoding Goppa codes, Inform. Contr. 27 (1975), 87\u201399.","journal-title":"Inform. Contr."},{"key":"4_CR31","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58575-3","volume-title":"Introduction to coding theory","author":"J.\u00a0H. Lint van","year":"1999","unstructured":"J.\u00a0H. van Lint, Introduction to coding theory, third ed., Graduate Texts in Mathematics, vol. 86, Springer, Berlin, 1999.","edition":"3"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"A. Vardy, Algorithmic complexity in coding theory and the minimum distance problem, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, 1997, pp.\u00a092\u2013109.","DOI":"10.1145\/258533.258559"}],"container-title":["Gr\u00f6bner Bases, Coding, and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93806-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T12:19:46Z","timestamp":1619525986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93806-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540938057","9783540938064"],"references-count":32,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-540-93806-4_4","relation":{},"published":{"date-parts":[[2009]]}}}