{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:29:42Z","timestamp":1740547782490,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206637"},{"type":"electronic","value":"9783540409748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40974-8_2","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:06:11Z","timestamp":1283727971000},"page":"4-23","source":"Crossref","is-referenced-by-count":0,"title":["High Rate Convolutional Codes with Optimal Cycle Weights"],"prefix":"10.1007","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d8yvind","family":"Ytrehus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/TIT.1980.1056194","volume":"IT-26","author":"F. Hemmati","year":"1980","unstructured":"Hemmati, F., Costello Jr., D.J.: Asymptotically catastrophic convolutional codes. IEEE Trans. Inform. Theory\u00a0IT-26, 298\u2013304 (1980)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/18.605599","volume":"43","author":"M.F. Hole","year":"1997","unstructured":"Hole, M.F., Hole, K.J.: Tight bounds on the minimum average weight per branch for rate (n \u2014 1)\/n convolutional codes. IEEE Trans. Inform. Theory\u00a043, 1301\u20131305 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/18.749009","volume":"44","author":"S. H\u00f6st","year":"1999","unstructured":"H\u00f6st, S., Johannesson, R., Zigangirov, K.S., Zyablov, V.V.: Active distances for convolutional codes. IEEE Trans. Inform. Theory\u00a044, 658\u2013669 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR4","unstructured":"Jordan, R., Pavlushkov, V., Zyablov, V.V.: Maximum slope convolutional codes. IEEE Trans. Inform. Theory (2001) (submitted for publication)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1109\/TIT.2002.801475","volume":"48","author":"I.E. Bocharova","year":"2002","unstructured":"Bocharova, I.E., Handlery, M., Johannesson, R., Kudryashov, B.D.: Tailbiting codes obtained via convolutional codes with large active distance-slopes. IEEE Trans. Inform. Theory\u00a048, 2577\u20132587 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TIT.1976.1055519","volume":"22","author":"G.K. Huth","year":"1976","unstructured":"Huth, G.K., Weber, C.L.: Minimum weight convolutional codewords of finite length. IEEE Trans. Inform. Theory\u00a022, 243\u2013246 (1976)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Jordan, R., Pavlushkov, V., Zyablov, V.V.: An upper bound on the slope of con-volutional codes. In: Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Lausanne, Switzerland, p. 424 (2002)","DOI":"10.1109\/ISIT.2002.1023696"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Rosnes, E.: Upper bound on the minimum average cycle weight of classes of convolutional codes. In: Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Yokohama, Japan, p. 280 (2003)","DOI":"10.1109\/ISIT.2003.1228295"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1109\/18.825838","volume":"46","author":"K.J. Hole","year":"2000","unstructured":"Hole, K.J.: On classes of convolutional codes that are not asymptotically catastrophic. IEEE Trans. Inform. Theory\u00a046, 663\u2013669 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/26.623061","volume":"45","author":"K.J. Hole","year":"1997","unstructured":"Hole, K.J.: A note on asymptotically catastrophic convolutional codes of rate (n \u2014 1)\/n. IEEE Trans. Commun.\u00a045, 1014\u20131016 (1997)","journal-title":"IEEE Trans. Commun."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1109\/18.333887","volume":"40","author":"V. Sidorenko","year":"1994","unstructured":"Sidorenko, V., Zyablov, V.: Decoding of convolutional codes using a syndrome trellis. IEEE Trans. Inform. Theory\u00a040, 1663\u20131666 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1109\/18.556680","volume":"42","author":"R. McEliece","year":"1996","unstructured":"McEliece, R., Lin, W.: The trellis complexity of convolutional codes. IEEE Trans. Inform. Theory\u00a042, 1855\u20131864 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"IT-20","author":"L.R. Bahl","year":"1974","unstructured":"Bahl, L.R., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inform. Theory\u00a0IT-20, 284\u2013287 (1974)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR14","unstructured":"McEliece, R.J.: The algebraic theory of convolutional codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 1065\u20131138. Elsevier, North-Holland (1998)"},{"key":"2_CR15","unstructured":"Ytrehus, \u00d8.: A note on high rate binary convolutional codes. Tech. Report no. 68, Department of Informatics, University of Bergen, Norway (1992)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1109\/18.556606","volume":"42","author":"P. CharnKeitKong","year":"1996","unstructured":"CharnKeitKong, P., Imai, H., Yamaguchi, K.: On classes of rate k\/(k + 1) convolutional codes and their decoding techniques. IEEE Trans. Inform. Theory\u00a042, 2181\u20132193 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/18.508834","volume":"42","author":"R.J. McEliece","year":"1996","unstructured":"McEliece, R.J.: On the BCJR trellis for linear block codes. IEEE Trans. Inform. Theory\u00a042, 1072\u20131092 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1109\/18.651075","volume":"44","author":"K.J. Hole","year":"1997","unstructured":"Hole, K.J., Ytrehus, \u00d8.: Cosets of convolutional codes with least possible maximum zero- and one-run lengths. IEEE Trans. Inform. Theory\u00a044, 423\u2013431 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR19","unstructured":"Hole, K.J.: On the growth rate of convolutional codes. Tech. Report no. 172, Department of Informatics, University of Bergen, Norway (1999)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Rosnes, E.,Ytrehus,\u00d8.: On maximum length convolutional codes under a trellis complexity constraint. Journal of Complexity (2003) (accepted for publication)","DOI":"10.1016\/j.jco.2003.08.018"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Bocharova, I.E., Kudryashov, B.D., Handlery, M., Johannesson, R.: How to efficiently find the minimum distance of tailbiting codes. In: Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Lausanne, Switzerland, p. 259 (2002)","DOI":"10.1109\/ISIT.2002.1023531"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. SIAM J. Discr. Math.\u00a023, 309\u2013311 (1978)","journal-title":"SIAM J. Discr. Math."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Dasdan, A., Irani, S.S., Gupta, R.K.: Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Proc. 36th Design Automation Conf. (DAC), New Orleans, LA, pp. 37\u201342 (1999)","DOI":"10.1145\/309847.309862"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40974-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T15:52:50Z","timestamp":1740498770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40974-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206637","9783540409748"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40974-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}