{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:15:23Z","timestamp":1775013323564,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"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":[[2009,12]]},"DOI":"10.1134\/s0032946009040061","type":"journal-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T19:59:16Z","timestamp":1263931156000},"page":"357-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Graph-based convolutional and block LDPC codes"],"prefix":"10.1134","volume":"45","author":[{"given":"I. E.","family":"Bocharova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. D.","family":"Kudryashov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. V.","family":"Satyukov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2010,1,21]]},"reference":[{"key":"4061_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963. Translated under the title Kody s maloi plotnost\u2019yu proverok na chetnost\u2019, Moscow: Mir, 1966."},{"key":"4061_CR2","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., and Thitimajshima, P., Near-Shannon-Limit Error-Correcting Coding and Decoding: Turbo-Codes. 1, in Proc. IEEE Int. Conf. on Communications (ICC\u201993), Geneva, Switzerland, 1993, vol. 2, pp. 1064\u20131070.","DOI":"10.1109\/ICC.1993.397441"},{"issue":"2","key":"4061_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"T.J. Richardson","year":"2001","unstructured":"Richardson, T.J., Shokrollahi, M.A., and Urbanke, R.L., Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 619\u2013637.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4061_CR4","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"X.-Y. Hu","year":"2003","unstructured":"Hu, X.-Y., Eleftheriou, E., and Arnold, D.M., Regular and Irregular Progressive Edge-Growth Tanner Graphs, IEEE Trans. Inform. Theory, 2003, vol. 51, no. 1, pp. 386\u2013398.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4061_CR5","unstructured":"Tanner, R.M., Sridhara, D., and Fuja, T., A Class of Group-Structured LDPC Codes, in Proc. 6th Int. Sympos. on Communication Theory and Applications (ISTCA-2001), Ambleside, Lake District, UK, 2001."},{"issue":"12","key":"4061_CR6","doi-asserted-by":"publisher","first-page":"2966","DOI":"10.1109\/TIT.2004.838370","volume":"50","author":"R.M. Tanner","year":"2004","unstructured":"Tanner, R.M., Sridhara, D., Sridharan, A., Fuja, T.E., and Costello, D.J., Jr., LDPC Block and Convolutional Codes Based on Circulant Matrices, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 12, pp. 2966\u20132984.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"4061_CR7","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"M.P.C. Fossorier","year":"2004","unstructured":"Fossorier, M.P.C., Quasi-cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 8, pp. 1788\u20131793.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4061_CR8","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":"4061_CR9","doi-asserted-by":"crossref","unstructured":"Malema, G. and Liebelt, M., High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs, EURASIP J. Wireless Commun. Networking, 2007, no. 1, Art. ID 48158, 5 pp.","DOI":"10.1155\/2007\/48158"},{"key":"4061_CR10","doi-asserted-by":"crossref","unstructured":"Malema, G. and Liebelt, M., Quasi-cyclic LDPC Codes of Column-Weight Two Using a Search Algorithm, EURASIP J. Adv. Signal Process., 2007, no. 4, Art. ID 45768, 8 pp.","DOI":"10.1155\/2007\/45768"},{"key":"4061_CR11","first-page":"4022","volume":"7","author":"H. Zhang","year":"2003","unstructured":"Zhang, H. and Moura, J., The Design of Structured Regular LDPC Codes with Large Girth, in Proc. IEEE 2003 Global Telecommunications Conf. (GLOBECOM\u201903), San Francisco, USA, vol. 7, 2003, pp. 4022\u20134027.","journal-title":"Proc. IEEE 2003 Global Telecommunications Conf. (GLOBECOM\u201903), San Francisco, USA"},{"key":"4061_CR12","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"},{"key":"4061_CR13","doi-asserted-by":"crossref","unstructured":"Hu, X.-Y., Fossorier, M.P.C., and Eleftheriou, E., On the Computation of the Minimum Distance of Low- Density Parity-Check Codes, in Proc. IEEE Int. Conf. on Communications (ICC\u201904), Paris, France, 2004, vol. 2, pp. 767\u2013771.","DOI":"10.1109\/ICC.2004.1312605"},{"issue":"2","key":"4061_CR14","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0137027","volume":"37","author":"G. Solomon","year":"1979","unstructured":"Solomon, G. and van Tilborg, H.C.A., A Connection Between Block and Convolutional Codes, SIAM J. Appl. Math., 1979, vol. 37, no. 2, pp. 358\u2013369.","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"4061_CR15","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1109\/TCOM.1986.1096498","volume":"34","author":"H. Ma","year":"1986","unstructured":"Ma, H. and Wolf, J., On Tail Biting Convolutional Codes, IEEE Trans. Commun., 1986, vol. 34, no. 2, pp. 104\u2013111.","journal-title":"IEEE Trans. Commun."},{"key":"4061_CR16","doi-asserted-by":"crossref","unstructured":"Biggs, N., Constructions for Cubic Graphs with Large Girth, Electron. J. Combin., 1998, vol. 5,Art. A1, 25 pp.","DOI":"10.37236\/1386"},{"key":"4061_CR17","unstructured":"Exoo, G. and Jajcay, R., Dynamic Cage Survey, Electron. J. Combin., 2008, vol. 15, Dynamic Survey DS16, 48 pp."},{"key":"4061_CR18","doi-asserted-by":"crossref","unstructured":"Lentmaier, M., Fettweis, G.P., Zigangirov, K.Sh., and Costello, D.J., Jr., Convolutional Codes for Iterative Decoding, in Proc. IEEE 10th Int. Sympos. on Spread Spectrum Techniques and Applications (ISSSTA\u201908), Bologna, Italy, 2008, pp. 785\u2013789.","DOI":"10.1109\/ISSSTA.2008.153"},{"key":"4061_CR19","doi-asserted-by":"crossref","unstructured":"Pusane, A.E., Smarandache, R., Vontobel, P.O., and Costello, D.J., Jr., On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT\u20192007), Nice, France, 2007, pp. 1221\u20131225.","DOI":"10.1109\/ISIT.2007.4557390"},{"key":"4061_CR20","doi-asserted-by":"crossref","unstructured":"Exoo, G., Voltage Graphs, Group Presentations and Cages, Electron. J. Combin., 2004, vol. 11, no. 1, Art. N2, 7 pp.","DOI":"10.37236\/1843"},{"key":"4061_CR21","series-title":"IMA Vols. Math. Appl.","first-page":"113","volume-title":"Codes, Systems and Graphical Models (Proc. IMA Workshop, Minneapolis, USA, 1999","author":"D.J.C. MacKay","year":"2001","unstructured":"MacKay, D.J.C. and Davey, M.C., Evaluation of Gallager Codes for Short Block Length and High Rate Applications, Codes, Systems and Graphical Models (Proc. IMA Workshop, Minneapolis, USA, 1999, Marcus, B. and Rosenthal, J., Eds., IMA Vols. Math. Appl., vol. 123, New York: Springer, 2001, pp. 113\u2013130."},{"issue":"5","key":"4061_CR22","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V.K. Wei","year":"1991","unstructured":"Wei, V.K., Generalized Hamming Weights for Linear Codes, IEEE Trans. Inform. Theory, 1991, vol. 37, no. 5, pp. 1412\u20131418.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"4061_CR23","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1109\/TIT.2007.901171","volume":"53","author":"S. Kim","year":"2007","unstructured":"Kim, S., No, J.-S., Chung, H., and Shin, D.-J., Quasi-cyclic Low-Density Parity-Check Codes with Girth Larger than 12, IEEE Trans. Inform. Theory, 2007, vol. 53, no. 8, pp. 2885\u20132891.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4061_CR24","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"1967","unstructured":"Hall, M., Jr., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970."},{"issue":"1","key":"4061_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"G.A. Margulis","year":"1982","unstructured":"Margulis, G.A., Explicit Constructions of Graphs without Short Cycles and Low Density Codes, Combinatorica, 1982, vol. 2, no. 1, pp. 71\u201378.","journal-title":"Combinatorica"},{"key":"4061_CR26","doi-asserted-by":"crossref","unstructured":"Lazebnik, F., Ustimenko, V.A., and Woldar, A.J., New Upper Bounds on the Order of Cages, Electron. J. Combin., 1997, vol. 4, no. 2, Art. R13, 11 pp.","DOI":"10.37236\/1328"},{"issue":"3","key":"4061_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., and Sarnak, P., Ramanujan Graphs, Combinatorica, 1988, vol. 8, no. 3, pp. 261\u2013277.","journal-title":"Combinatorica"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946009040061.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946009040061","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946009040061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946009040061.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:06:58Z","timestamp":1775009218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946009040061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["4061"],"URL":"https:\/\/doi.org\/10.1134\/s0032946009040061","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]},"assertion":[{"value":"9 June 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}