{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:58:13Z","timestamp":1743011893559,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006482","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"21-25","source":"Crossref","is-referenced-by-count":5,"title":["Generalized column distances for convolutional codes"],"prefix":"10.1109","author":[{"given":"Sara D.","family":"Cardell","sequence":"first","affiliation":[]},{"given":"Marcelo","family":"Firer","sequence":"additional","affiliation":[]},{"given":"Diego","family":"Napp","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/18.133259"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/18.179366"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/18.21242"},{"volume-title":"The Theory of Error-Correcting Codes","year":"1988","author":"MacWilliams","key":"ref4"},{"volume-title":"Coding and Information Theory","year":"1992","author":"Roman","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/BF01222850"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/BF00124590"},{"issue":"2","key":"ref8","first-page":"1741","article-title":"Dimension\/Length Profiles and Trellis Complexity of Linear Block Codes","volume":"41","author":"Forney","year":"1995","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"ref9","first-page":"432","article-title":"Bounds on the Minimum Support Weights","volume":"40","author":"Helleseth","year":"1994","journal-title":"IEEE Transactions on Information Theory"},{"volume-title":"Complete-MDP convolutional codes over the erasure channel","year":"2010","author":"Tom\u00e1s","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ISIT.2009.5205686"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ITA.2014.6804237"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2006.881719"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ISIT.2008.4595148"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.laa.2013.06.013"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.laa.2016.02.034"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIT.2005.862100"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/18.567750"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/18.567708"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/9780470544693"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.laa.2008.02.011"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.4171\/JEMS\/316"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006482.pdf?arnumber=8006482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T00:24:08Z","timestamp":1706055848000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006482\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006482","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}