{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T19:54:16Z","timestamp":1771962856084,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,4,15]],"date-time":"2012-04-15T00:00:00Z","timestamp":1334448000000},"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":[[2013,12]]},"DOI":"10.1007\/s10623-012-9657-7","type":"journal-article","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T07:29:42Z","timestamp":1334388582000},"page":"275-297","source":"Crossref","is-referenced-by-count":14,"title":["Code constructions and existence bounds for relative generalized Hamming weight"],"prefix":"10.1007","volume":"69","author":[{"given":"Zhuojun","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,15]]},"reference":[{"key":"9657_CR1","unstructured":"Chor B., Goldreich O., H\u00e5stad J., Friedmann J., Rudich S., Smolensky R.: The bit extraction problem of t-resilient functions. In: 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, pp. 397\u2013407 (1985)."},{"issue":"6","key":"9657_CR2","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.1109\/18.340487","volume":"40","author":"G. Cohen","year":"1994","unstructured":"Cohen G., Litsyn S., Z\u00e9mor G.: Upper bounds on generalized distances. IEEE Trans. Inf. Theory 40(6), 2090\u20132092 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9657_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/18.272476","volume":"40","author":"S. Encheva","year":"1994","unstructured":"Encheva S., Kl\u00f8ve T.: Codes satisfying the chain condition. IEEE Trans. Inf. Theory 40(1), 175\u2013180 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"22","key":"9657_CR4","first-page":"48","volume":"6","author":"Y. Fan","year":"2001","unstructured":"Fan Y., Liu H.: Equidistant linear codes and maximal projective codes. J. China Inst. Commun. 6(22), 48\u201352 (2001)","journal-title":"J. China Inst. Commun."},{"issue":"6","key":"9657_CR5","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"G.D. Forney","year":"1994","unstructured":"Forney G.D.: Dimension\/length profiles and trellis complexity of linear block codes. IEEE Trans. Inf. Theory 40(6), 1741\u20131752 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9657_CR6","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/18.370144","volume":"41","author":"T. Helleseth","year":"1995","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)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9657_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(77)90078-4","volume":"18","author":"T. Helleseth","year":"1977","unstructured":"Helleseth T., Kl\u00f8ve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths n 1((q l \u22121)\/N). Discret. Math. 18, 179\u2013211 (1977)","journal-title":"Discret. Math."},{"issue":"3","key":"9657_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/18.135655","volume":"38","author":"T. Helleseth","year":"1992","unstructured":"Helleseth T., Kl\u00f8ve T., Ytrehus \u00d8.: Generalized Hamming weights of linear codes. IEEE Trans. Inf. Theory 38(3), 133\u20131140 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9657_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W.C. Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"9657_CR10","volume-title":"Design Theory","author":"D.R. Hughes","year":"1998","unstructured":"Hughes D.R., Piper F.C.: Design Theory. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"9657_CR11","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/18.179366","volume":"39","author":"T. Kasami","year":"1993","unstructured":"Kasami T., Takata T., Fujiwara T., Lin S.: On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes. IEEE Trans. Inf. Theory 39(1), 242\u2013243 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9657_CR12","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/18.481787","volume":"42","author":"T. Kl\u00f8ve","year":"1996","unstructured":"Kl\u00f8ve T.: The worst case propability of undetected error for linear codes on the local binomial channels. IEEE Trans. Inf. Theory 42(1), 172\u2013196 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9657_CR13","unstructured":"Komura T., Oka M., Fujiwara T., Onoye T., Kasami T., Lin S.: VLSI architecture of a recursive maximum-likelihood decoding algorithm for a (64,35) subcode of the (64,42) Reed\u2013Muller code. In: International Symposium on Information Theory and Its Applications, Victoria, pp. 396\u2013407 (1996)."},{"key":"9657_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5745-6","volume-title":"Trellises and Trellis-based Decoding Algorithms for Linear Block Codes","author":"S. Lin","year":"1998","unstructured":"Lin S., Kasami T., Fujiwara T., Fossorier M.: Trellises and Trellis-based Decoding Algorithms for Linear Block Codes. Kluwer Academic Press, Boston (1998)"},{"key":"9657_CR15","unstructured":"Lin S., Uehara G.T., Nakamura E., Chu W.P.: Circuit design approaches for implementation of a subtrellis IC for a Reed\u2013Muller subcode. NASA Tech. Rep. 96\u2013001 (1996)."},{"key":"9657_CR16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10623-008-9170-1","volume":"48","author":"Z. Liu","year":"2008","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)","journal-title":"Des. Codes Cryptogr."},{"key":"9657_CR17","unstructured":"Luo Y., Fu F., Mitrpant C., Han Vinck A.J.: Relative MDS pairs. Unpublished manuscript."},{"issue":"3","key":"9657_CR18","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/TIT.2004.842763","volume":"51","author":"Y. Luo","year":"2005","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)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9657_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1988","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1988)"},{"issue":"10","key":"9657_CR20","doi-asserted-by":"crossref","first-page":"2135","DOI":"10.1002\/j.1538-7305.1984.tb00072.x","volume":"63","author":"L.H. Ozarow","year":"1984","unstructured":"Ozarow L.H., Wyner A.D.: Wire-tap channel II. Bell Labs Tech. J. 63(10), 2135\u20132157 (1984)","journal-title":"Bell Labs Tech. J."},{"issue":"6","key":"9657_CR21","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1109\/18.476213","volume":"41","author":"M.A. Tsfasman","year":"1995","unstructured":"Tsfasman M.A., Vl\u01cedut S.G.: Geometric approach to higher weights. IEEE Trans. Inf. Theory 41(6), 1564\u20131588 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"9657_CR22","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V.K. Wei","year":"1991","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412\u20131418 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9657_CR23","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","volume":"24","author":"J.K. Wolf","year":"1978","unstructured":"Wolf J.K.: Efficient maximum likelihood decoding of linear block codes. IEEE Trans. Inf. Theory, IT- 24(1), 76\u201380 (1978)","journal-title":"IEEE Trans. Inf. Theory, IT-"},{"key":"9657_CR24","unstructured":"Zhang Z.: Wiretap networks II with partial information leakage. In: 4th International Conference on Communications and Networking in China, Xi\u2019an, pp. 1\u20135 (2009)."},{"key":"9657_CR25","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, pp. 70\u201374 (2009)."},{"key":"9657_CR26","unstructured":"Zhuang Z., Luo Y., Dai B., Han Vinck A.J.: Relative dimension\/length profile and its applications. Des. Codes Cryptogr. (in manuscript)."},{"key":"9657_CR27","unstructured":"Zhuang Z., Luo Y., Han Vinck A.J.: Bounds on relative generalized Hamming weight. Inf. Sci. (in manuscript)."},{"key":"9657_CR28","unstructured":"Zhuang Z., Luo Y., Han Vinck A.J., Dai B.: Some new bounds on relative generalized Hamming weight. In: 13th International Conference on Communication Technology, Jinan, pp. 971\u2013974 (2011)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9657-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9657-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9657-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:33Z","timestamp":1559246313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9657-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,15]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9657"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9657-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,15]]}}}