{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:10:03Z","timestamp":1775013003164,"version":"3.50.1"},"reference-count":9,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1134\/s0032946011010017","type":"journal-article","created":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T02:40:17Z","timestamp":1303094417000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Woven convolutional graph codes with large free distances"],"prefix":"10.1134","volume":"47","author":[{"given":"I. E.","family":"Bocharova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Hug","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Johannesson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. D.","family":"Kudryashov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2011,4,19]]},"reference":[{"key":"4094_CR1","doi-asserted-by":"crossref","unstructured":"Bocharova, I.E., Kudryashov, B.D., Johannesson, R., and Zyablov, V.V., Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT\u20192007), Nice, France, 2007, pp. 2326\u20132330.","DOI":"10.1109\/ISIT.2007.4557169"},{"issue":"1","key":"4094_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TIT.2009.2034787","volume":"56","author":"I.E. Bocharova","year":"2010","unstructured":"Bocharova, I.E., Kudryashov, B.D., Johannesson, R., and Zyablov, V.V., Woven Graph Codes: Asymptotic Performances and Examples, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 1, pp. 121\u2013129.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4094_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1976","unstructured":"Berge, C., Graphs and Hypergraphs, Amsterdam: North-Holland, 1976."},{"issue":"4","key":"4094_CR4","first-page":"69","volume":"45","author":"I.E. Bocharova","year":"2009","unstructured":"Bocharova, I.E., Kudryashov, B.D., and Satyukov, R.V., Graph-Based Convolutional and Block LDPC Codes, Probl. Peredachi Inf., 2009, vol. 45, no. 4, pp. 69\u201390 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 4, pp. 357\u2013377].","journal-title":"Probl. Peredachi Inf."},{"issue":"5","key":"4094_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1981","unstructured":"Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 5, pp. 533\u2013547.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4094_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693","volume-title":"Fundamentals of Convolutional Coding","author":"R. Johannesson","year":"1999","unstructured":"Johannesson, R. and Zigangirov, K.Sh., Fundamentals of Convolutional Coding, Piscataway: IEEE Press, 1999."},{"issue":"1","key":"4094_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/18.971745","volume":"48","author":"S. H\u00f6st","year":"2002","unstructured":"H\u00f6st, S., Johannesson, R., and Zyablov, V.V., Woven Convolutional Codes I: Encoder Properties, IEEE Trans. Inform. Theory, 2002, vol. 48, no. 1, pp. 149\u2013161.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"4094_CR8","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1109\/TIT.2004.828093","volume":"50","author":"I.E. Bocharova","year":"2004","unstructured":"Bocharova, I.E., Handlery, M., Johannesson, R., and Kudryashov, B.D., A BEAST for Prowling in Trees, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 6, pp. 1295\u20131302.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"4094_CR9","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1109\/TIT.2010.2040966","volume":"56","author":"F. Hug","year":"2010","unstructured":"Hug, F., Bocharova, I.E, Johannesson, R., and Kudryashov, B.D., A Rate R = 5\/20 Hypergraph-Based Woven Convolutional Code with Free Distance 120, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 4, pp. 1618\u20131623.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011010017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946011010017","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011010017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011010017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:04:45Z","timestamp":1775009085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946011010017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["4094"],"URL":"https:\/\/doi.org\/10.1134\/s0032946011010017","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]},"assertion":[{"value":"5 May 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2010","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2011","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}