{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:02:23Z","timestamp":1648717343680},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T00:00:00Z","timestamp":1397606400000},"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":[[2015,7]]},"DOI":"10.1007\/s10623-014-9962-4","type":"journal-article","created":{"date-parts":[[2014,4,15]],"date-time":"2014-04-15T10:50:02Z","timestamp":1397559002000},"page":"37-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal codes as Tanner codes with cyclic component codes"],"prefix":"10.1007","volume":"76","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Pi\u00f1ero","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,16]]},"reference":[{"key":"9962_CR1","doi-asserted-by":"crossref","unstructured":"Becker T., Weispfenning V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Springer, New York (1993).","DOI":"10.1007\/978-1-4612-0913-3"},{"key":"9962_CR2","doi-asserted-by":"crossref","unstructured":"Beelen P., H\u00f8holdt T., Pi\u00f1ero F., Justesen J.: On the Dimension of graph codes with Reed-Solomon component codes. In: ISIT, pp. 1227\u20131231 (2013).","DOI":"10.1109\/ISIT.2013.6620422"},{"key":"9962_CR3","doi-asserted-by":"crossref","unstructured":"Cox D., Little J., O\u2019Shea D.: Ideals, Varieties and Algorithms. Springer, New York (2007).","DOI":"10.1007\/978-0-387-35651-8"},{"key":"9962_CR4","doi-asserted-by":"crossref","unstructured":"Fitzgerald J., Lax R.: Decoding affine variety codes using Gr\u00f6bner bases. DCC 13, 147\u2013158 (1998). doi: 10.1023\/A:1008274212057 .","DOI":"10.1023\/A:1008274212057"},{"key":"9962_CR5","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de (2007). Accessed on 22 Nov 2013."},{"key":"9962_CR6","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt T., Justesen J.: The Minimum Distance of Graph Codes. Lecture Notes in Computer Science, vol. 6639, pp. 201\u2013212. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-20901-7_12"},{"key":"9962_CR7","doi-asserted-by":"crossref","unstructured":"Roth R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006).","DOI":"10.1017\/CBO9780511808968"},{"key":"9962_CR8","doi-asserted-by":"crossref","unstructured":"Sipser M., Spielman D.: Expander codes. IEEE Trans. Inf. Theory 42(6), 1710\u20131722 (1996). doi: 10.1109\/18.556667 .","DOI":"10.1109\/18.556667"},{"key":"9962_CR9","doi-asserted-by":"crossref","unstructured":"Stichtenoth H.: On the dimension of subfield subcodes. IEEE Trans. Inf. Theory 36(1), 90\u201393 (1990).","DOI":"10.1109\/18.50376"},{"key":"9962_CR10","doi-asserted-by":"crossref","unstructured":"Tanner R.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27(5), 533\u2013547 (1981). doi: 10.1109\/TIT.1981.1056404 .","DOI":"10.1109\/TIT.1981.1056404"},{"key":"9962_CR11","doi-asserted-by":"crossref","unstructured":"Zemor G.: On expander codes. IEEE Trans. Inf. Theory 47(2), 835\u2013837 (2001). doi: 10.1109\/18.910593 .","DOI":"10.1109\/18.910593"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9962-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9962-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9962-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:39Z","timestamp":1559246319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9962-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,16]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9962"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9962-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,16]]}}}