{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:23Z","timestamp":1773377663518,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849486","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2783-2787","source":"Crossref","is-referenced-by-count":4,"title":["Unrestricted Generalized Column Distances: A Wider Definition"],"prefix":"10.1109","author":[{"given":"Sara D.","family":"Cardell","sequence":"first","affiliation":[{"name":"Imecc, University of Campinas, Brazil"}]},{"given":"Diego","family":"Napp","sequence":"additional","affiliation":[{"name":"DM, University of Alicante, Spain"}]},{"given":"Marcelo","family":"Firer","sequence":"additional","affiliation":[{"name":"Imecc, University of Campinas, Brazil"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2704586"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.07.008"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.340487"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205686"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804237"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881719"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595148"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.06.013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.02.034"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862100"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.567750"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.567708"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285217"},{"key":"ref4","author":"roman","year":"1992","journal-title":"Coding and Information Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613295"},{"key":"ref3","author":"macwilliams","year":"1988","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124590"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.370144"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01222850"},{"key":"ref8","first-page":"432","article-title":"Bounds on the Minimum Support Weights","volume":"40","author":"helleseth","year":"1994","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref7","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"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.179366"},{"key":"ref9","article-title":"Complete-MDP convolutional codes over the erasure channel","author":"tom\u00e1s","year":"2010","journal-title":"Ph D Dissertation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.02.011"},{"key":"ref22","first-page":"733","article-title":"On sets of vectors of a finite vector space in which every subset of basis size is a basis","volume":"14","author":"ball","year":"2010","journal-title":"J Eur Math Soc"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016005"},{"key":"ref24","first-page":"733","article-title":"On sets of vectors of a finite vector space in which every subset of basis size is a basis","volume":"14","author":"ball","year":"2010","journal-title":"J Eur Math Soc"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006482"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.412691"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1991.695106"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849486.pdf?arnumber=8849486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:48Z","timestamp":1773347688000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849486\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849486","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}