{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:59Z","timestamp":1754161619813,"version":"3.41.2"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1023\/a:1008225524987","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"47-66","source":"Crossref","is-referenced-by-count":4,"title":["Weight Hierarchies of Linear Codes Satisfying the Chain Condition"],"prefix":"10.1007","volume":"15","author":[{"given":"Wende","family":"Chen","sequence":"first","affiliation":[]},{"given":"Torleiv","family":"Klove","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"168581_CR1","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1109\/18.412691","volume":"41","author":"A. I. Barbero","year":"1995","unstructured":"A. I. Barbero and J. G. Tena, Weight hierarchy of a product code, IEEE Trans. Inform. Theory, Vol. 41, No.5 (1995) pp. 1475-1479.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"168581_CR2","doi-asserted-by":"crossref","first-page":"2265","DOI":"10.1109\/18.556621","volume":"42","author":"W. Chen","year":"1996","unstructured":"W. Chen and T. Kl\u00f8ve, The weight hierarchies of q-ary codes of dimension 4, IEEE Trans. Inform. Theory, Vol. 42, No.6 (1996) pp. 2265-2272.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"168581_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/18.272476","volume":"40","author":"S. Encheva","year":"1994","unstructured":"S. Encheva and T. Kl\u00f8ve, Codes satisfying the chain condition, IEEE Trans. Inform. Theory, Vol. 40, No.1 (1994) pp. 175-180.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"168581_CR4","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"G. D. Forney","year":"1994","unstructured":"G. D. Forney, Dimension\/length profiles and trellis complexity of linear block codes, IEEE Trans. Inform. Theory, Vol. 40, No.6 (1994) pp. 1741-1752.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"168581_CR5","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/18.490571","volume":"42","author":"T. Helleseth","year":"1996","unstructured":"T. Helleseth and T. Kl\u00f8ve, The weight hierarchies of some product codes, IEEE Trans. Inform. Theory, Vol. 42, No.3 (1996) pp. 1029-1034.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"168581_CR6","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/18.135655","volume":"38","author":"T. Helleseth","year":"1992","unstructured":"T. Helleseth, T. Kl\u00f8ve and \u00d8. Ytrehus, Generalized Hamming weights of linear codes, IEEE Trans. Inform. Theory, Vol. 38, No.3 (1992) pp. 1133-1140.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"168581_CR7","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/18.179366","volume":"39","author":"T. Kasami","year":"1993","unstructured":"T. Kasami, T. Takata, T. Fujiwara and S. Lin, On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes, IEEE Trans. Inform. Theory, Vol. 39, No.1 (1993) pp. 242-243.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"168581_CR8","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/18.312184","volume":"40","author":"A. Vardy","year":"1994","unstructured":"A. Vardy and Y. Be'ery, Maximum-likelihood soft decision decoding of BCH codes, IEEE Trans. Inform. Theory, Vol. 40, No.2 (1994) pp. 546-554.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"168581_CR9","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1109\/18.259662","volume":"39","author":"V. K. Wei","year":"1993","unstructured":"V. K. Wei and K. Yang, On the generalized Hamming weights of product codes, IEEE Trans. Inform. Theory, Vol. 39, No.5 (1993) pp. 1709-1713.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008225524987.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008225524987\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008225524987.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:51:28Z","timestamp":1753761088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008225524987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["168581"],"URL":"https:\/\/doi.org\/10.1023\/a:1008225524987","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}