{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:51:52Z","timestamp":1761663112527},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,10,23]],"date-time":"2012-10-23T00:00:00Z","timestamp":1350950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10623-012-9750-y","type":"journal-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T10:18:49Z","timestamp":1350901129000},"page":"219-247","source":"Crossref","is-referenced-by-count":9,"title":["On the relative profiles of a linear code and a subcode"],"prefix":"10.1007","volume":"72","author":[{"given":"Zhuojun","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Han Vinck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,23]]},"reference":[{"key":"9750_CR1","unstructured":"Encheva S., Kl\u00f8ve T.: Codes satisfying the chain condition. IEEE Trans. Inf. Theory 40(1), 175\u2013180 (1994)."},{"key":"9750_CR2","unstructured":"Forney G.D.: Dimension\/length profiles and trellis complexity of linear block codes. IEEE Trans. Inf. Theory 40(6), 1741\u20131752 (1994)."},{"key":"9750_CR3","unstructured":"Helleseth T., Kl\u00f8ve T., Mykkelveit J.: The weight distribution of irreducible cyclic codes with block length n 1((q l \u22121)\/N) n . Discret. Math. 18, 179\u2013211 (1977)."},{"key":"9750_CR4","unstructured":"Helleseth T., Kl\u00f8ve T., Ytrehus \u00d8.: Generalized Hamming weights of linear codes. IEEE Trans. Inf. Theory 38(3), 1133\u20131140 (1992)."},{"key":"9750_CR5","unstructured":"Helleseth T., Kl\u00f8ve T., Levenshtein V.I., Ytrehus \u00d8.: Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2), 432\u2013440 (1995)."},{"key":"9750_CR6","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University, Cambridge (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"9750_CR7","unstructured":"Hughes D.R., Piper F.C.: Design Theory. Cambridge University, Cambridge (1998)."},{"key":"9750_CR8","doi-asserted-by":"crossref","unstructured":"Kl\u00f8ve T.: Support weight distribution of linear codes. Discret. Math. 107, 311\u2013316 (1992).","DOI":"10.1016\/0012-365X(92)90559-X"},{"key":"9750_CR9","unstructured":"Lafourcade A., Vardy A.: Lower bounds on trellis complexity of block codes. IEEE Trans. Inf. Theory 41(6), 1938\u20131954 (1995)."},{"key":"9750_CR10","doi-asserted-by":"crossref","unstructured":"Lin S., Kasami T., Fujiwara T., Fossorier M.: Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Kluwer, Massachusetts (1998).","DOI":"10.1007\/978-1-4615-5745-6"},{"key":"9750_CR11","doi-asserted-by":"crossref","unstructured":"Liu Z., Chen W., Luo Y.: The relative generalized Hamming weight of linear q-ary codes and their subcodes. Des. Codes Cryptogr. 48, 111\u2013123 (2008).","DOI":"10.1007\/s10623-008-9170-1"},{"key":"9750_CR12","unstructured":"Luo Y., Mitrpant C., Han Vinck A.J., Chen K.F.: Some new characters on the wire-tap channel of type II. IEEE Trans. Inf. Theory 51(3), 1222\u20131229 (2005)."},{"key":"9750_CR13","unstructured":"Luo Y., Han Vinck A.J., Chen Y.: On the optimum distance profiles about linear block codes. IEEE Trans. Inf. Theory 56(3), 1007\u20131014 (2010)."},{"key":"9750_CR14","unstructured":"Luo Y., Fu F., Mitrpant C., Han Vinck A.J.: Relative MDS pairs. Unpublished manuscript."},{"key":"9750_CR15","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1988)."},{"key":"9750_CR16","unstructured":"Muder D.J.: Minimal trellises for block codes. IEEE Trans. Inf. Theory 34(5), 1049\u20131053 (1988)."},{"key":"9750_CR17","unstructured":"Ozarow L.H., Wyner A.D.: Wire-tap channel II. Bell Labs Tech. J. 63(10), 2135\u20132157 (1984)."},{"key":"9750_CR18","unstructured":"Reuven I., Be\u2019ery Y.: Entropy\/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes. IEEE Trans. Inf. Theory 44(2), 580\u2013598 (1998)."},{"key":"9750_CR19","doi-asserted-by":"crossref","unstructured":"Simonis J.: The effective length of subcodes. Appl. Algebr. Eng. Commun. 5, 371\u2013377 (1994).","DOI":"10.1007\/BF01188748"},{"key":"9750_CR20","doi-asserted-by":"crossref","unstructured":"Wang P., Luo Y., Han Vinck A.J.: Some upper bounds on the inverse relative dimension\/length profile. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E91-A(12), 3731\u20133737 (2008).","DOI":"10.1093\/ietfec\/e91-a.12.3731"},{"key":"9750_CR21","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412\u20131418 (1991)."},{"key":"9750_CR22","doi-asserted-by":"crossref","unstructured":"Wolf J.K.: Efficient maximum likelihood decoding of linear block codes. IEEE Trans. Inf. Theory IT-24(1), 76\u201380 (1978).","DOI":"10.1109\/TIT.1978.1055821"},{"issue":"6","key":"9750_CR23","first-page":"1","volume":"18","author":"Y. Yang","year":"1990","unstructured":"Yang Y., Hu Z.: Structure analysis of linear constant weight codes. Acta Electron. Sin. 18(6), 1\u20138 (1990)","journal-title":"Acta Electron. Sin."},{"key":"9750_CR24","unstructured":"Ytrehus \u00d8.: On the trellis complexity of certain binary linear block codes. IEEE Trans. Inf. Theory 41(2), 559\u2013560 (1995)."},{"key":"9750_CR25","unstructured":"Zhang Z.: Wiretap networks II with partial information leakage. In: 4th International Conference on Communications and Networking in China, Xi\u2019an, China, pp. 1\u20135 (2009)."},{"key":"9750_CR26","unstructured":"Zhang Z., Zhuang B.: An application of the relative network generalized Hamming weight to erroneous wiretap networks. In: 2009 IEEE Information Theory Workshop, Taormina, Italy, pp. 70\u201374 (2009)."},{"key":"9750_CR27","unstructured":"Zhuang Z., Luo Y., Han Vinck A.J.: Bounds on relative generalized Hamming weight. Unpublished manuscript."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9750-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9750-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9750-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T17:55:31Z","timestamp":1562262931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9750-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,23]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9750"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9750-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,23]]}}}