{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:00:59Z","timestamp":1649131259928},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,28]],"date-time":"2012-06-28T00:00:00Z","timestamp":1340841600000},"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,4]]},"DOI":"10.1007\/s10623-012-9715-1","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T12:16:39Z","timestamp":1340799399000},"page":"47-56","source":"Crossref","is-referenced-by-count":4,"title":["Constructing rate 1\/p systematic binary quasi-cyclic codes based on the matroid theory"],"prefix":"10.1007","volume":"71","author":[{"given":"Guangfu","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Chiu","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. K.","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,28]]},"reference":[{"key":"9715_CR1","doi-asserted-by":"crossref","unstructured":"Shannon C.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379\u2013423 and 623\u2013656 (1948).","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"issue":"1","key":"9715_CR2","first-page":"130","volume":"IT-13","author":"E.J. Weldon Jr.","year":"1970","unstructured":"Weldon E.J. Jr.: Long quasi-cyclic codes are good. IEEE Trans. Inf. Theory IT-13(1), 130 (1970)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9715_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/TIT.1967.1053974","volume":"IT-13","author":"R.L. Townsend","year":"1967","unstructured":"Townsend R.L., Weldon E.J. Jr.: Self-orthogonal quasi-cyclic codes. IEEE Trans. Inf. Theory IT-13(2), 183\u2013195 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9715_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.1969.1054261","volume":"IT-15","author":"M. Karlin","year":"1969","unstructured":"Karlin M.: New binary coding results by circulants. IEEE Trans. Inf. Theory IT-15(1), 81\u201392 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"9715_CR5","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1109\/TIT.1970.1054538","volume":"IT-16","author":"M. Karlin","year":"1970","unstructured":"Karlin M.: Decoding of circulant codes. IEEE Trans. Inf. Theory IT-16(6), 797\u2013802 (1970)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9715_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","volume":"15","author":"C.L. Chen","year":"1969","unstructured":"Chen C.L., Peterson W.W., Weldon E.J. Jr.: Some results on quasi-cyclic codes. Inf. Control 15, 407\u2013423 (1969)","journal-title":"Inf. Control"},{"issue":"4","key":"9715_CR7","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TIT.1970.1054478","volume":"IT-16","author":"C.W. Hoffner","year":"1970","unstructured":"Hoffner C.W., Reddy S.M.: Circulant bases for cyclic codes. IEEE Trans. Inf. Theory IT-16(4), 511\u2013512 (1970)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9715_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TIT.1974.1055152","volume":"IT-20","author":"S.E. Tavares","year":"1974","unstructured":"Tavares S.E., Bhargava V.K., Shiva S.G.S.: Some rate-p\/(p + 1) quasi-cyclic codes. IEEE Trans. Inf. Theory IT-20(1), 133\u2013135 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"9715_CR9","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1109\/TIT.1978.1055930","volume":"IT-24","author":"V.K. Bhargava","year":"1978","unstructured":"Bhargava V.K., Seguin G.E., Stein J.M.: Some (mk, k) cyclic codes in quasi-cyclic form. IEEE Trans. Inf. Theory IT-24(5), 630\u2013632 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9715_CR10","unstructured":"Chen Z.: [Online].(2011), Available: http:\/\/www.tec.hkr.se\/~chen\/research\/codes\/ . Accessed Septemper 2011)."},{"issue":"5","key":"9715_CR11","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/TIT.1978.1055929","volume":"IT-24","author":"H.C.A. Tilborg van","year":"1978","unstructured":"van Tilborg H.C.A.: On quasi-cyclic codes with rate 1\/m. IEEE Trans. Inf. Theory IT-24(5), 628\u2013629 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9715_CR12","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/18.79911","volume":"IT-37","author":"T.A. Gulliver","year":"1991","unstructured":"Gulliver T.A., Bhargava V.K.: Some best rate 1\/p and rate (p-1)\/p systematic quasi-cyclic codes. IEEE Trans. Inf. Theory IT-37(3), 552\u2013555 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"9715_CR13","doi-asserted-by":"crossref","first-page":"1366","DOI":"10.1109\/18.144718","volume":"IT-38","author":"T.A. Gulliver","year":"1992","unstructured":"Gulliver T.A., Bhargava V.K.: Nine good (m-1)\/pm quasi-cyclic codes. IEEE Trans. Inf. Theory IT-38(4), 1366\u20131369 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"9715_CR14","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1109\/18.259670","volume":"IT-39","author":"T.A. Gulliver","year":"1993","unstructured":"Gulliver T.A., Bhargava V.K.: Twelve good rate (m-r)\/pm binary quasi-cyclic codes. IEEE Trans. Inf. Theory IT-39(5), 1750\u20131751 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"9715_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0893-9659(95)00071-W","volume":"8","author":"T.A. Gulliver","year":"1995","unstructured":"Gulliver T.A., Bhargava V.K.: An updated table of rate 1\/p binary Quasi-Cyclic codes. Appl. Math. Lett. 8(5), 81\u201386 (1995)","journal-title":"Appl. Math. Lett."},{"issue":"5","key":"9715_CR16","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/18.333888","volume":"IT-40","author":"Z. Chen","year":"1994","unstructured":"Chen Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory IT-40(5), 1666\u20131667 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9715_CR17","unstructured":"Chen Z.: On Computer Search for Good Quasi-Cyclic Codes. IEEE Symp. on Information Theory, Norway (1994)."},{"key":"9715_CR18","unstructured":"Zhi C.: New results on binary quasi-cyclic codes. Proceeding IEEE Intern. Symp. on Information Theory, ISIT2000, Sorrento, Italy (2000)."},{"key":"9715_CR19","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney H.: On the abstract properties of linear dependence. Am. J. Math. 57, 509\u2013533 (1935)","journal-title":"Am. J. Math."},{"key":"9715_CR20","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1959-0101527-3","volume":"90","author":"W.T. Tutte","year":"1959","unstructured":"Tutte W.T.: Matroids and graphs. Trans. Am. Math. Soc. 90, 527\u2013552 (1959)","journal-title":"Trans. Am. Math. Soc."},{"key":"9715_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J., Fulkerson D.R.: Transversals and matroid partition. J. Res. Natl. Bur. Stand. 69B, 147\u2013153 (1965)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9715_CR22","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/sapm1976552119","volume":"55","author":"C. Greene","year":"1976","unstructured":"Greene C.: Weight enumeration and the geometry of linear codes. Studia Appl. Math. 55, 119\u2013128 (1976)","journal-title":"Studia Appl. Math."},{"key":"9715_CR23","unstructured":"Geelen J., Gerards B., Whittle G.: Towards a matroid-minor structure theory. In: Grimmett G., McDiarmid C. (eds.) Combinatorics, Complexity and Chance. A Tribute to Dominic Welsh. Oxford University Press (2007)."},{"key":"9715_CR24","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S.-Y.R., Yeung R.W.: Network information flow. IEEE Trans. Inf. Theory 46, 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"9715_CR25","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1109\/TIT.2007.896862","volume":"53","author":"R. Dougherty","year":"2007","unstructured":"Dougherty R., Freiling C., Zeger K.: Networks, matroids, and non-Shannon information inequalities. IEEE Trans. Inf. Theory 53(6), 1949\u20131969 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9715_CR26","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J. Feldman","year":"2005","unstructured":"Feldman J., Wainwright M.J., Karger D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inf. Theory 51(3), 954\u2013972 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9715_CR27","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s002000050060","volume":"8","author":"A. Barg","year":"1997","unstructured":"Barg A.: The matroid of supports of a linear code. Appl. Algebra Eng. Commun. Comput. 8(2), 165\u2013172 (1997)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9715_CR28","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"9715_CR29","unstructured":"Grassl M.: Tables of linear codes and quantum codes. [Online]. Available at http:\/\/www.codetables.de . Accessed Septemper 2011."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9715-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9715-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9715-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T05:40:17Z","timestamp":1561873217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9715-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,28]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9715"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9715-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,28]]}}}