{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T20:25:32Z","timestamp":1709324732788},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,3]],"date-time":"2015-05-03T00:00:00Z","timestamp":1430611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s12095-015-0134-9","type":"journal-article","created":{"date-parts":[[2015,5,2]],"date-time":"2015-05-02T08:54:12Z","timestamp":1430556852000},"page":"19-32","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On encoding symbol degrees of array BP-XOR codes"],"prefix":"10.1007","volume":"8","author":[{"given":"Maura B.","family":"Paterson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongge","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,3]]},"reference":[{"key":"134_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Edmonds, J., Luby, M.: Linear time erasure codes with nearly optimal recovery. In: Proc. 36th FOCS, pages 512\u2013519. IEEE Computer Society (1995)","DOI":"10.1109\/SFCS.1995.492581"},{"issue":"10","key":"134_CR2","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/26.539767","volume":"44","author":"C Berrou","year":"1996","unstructured":"Berrou, C., Glavieux, A.: Near optimum error correcting coding and decoding: Turbo-codes. Communications, IEEE Transactions on 44(10), 1261\u20131271 (1996)","journal-title":"Communications, IEEE Transactions on"},{"key":"134_CR3","doi-asserted-by":"crossref","unstructured":"Blaum, M.: A family of mds array codes with minimal number of encoding operations. In: Proc. IEEE ISIT 2006, pages 2784\u20132788. IEEE (2006)","DOI":"10.1109\/ISIT.2006.261569"},{"issue":"2","key":"134_CR4","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/12.364531","volume":"44","author":"M Blaum","year":"1995","unstructured":"Blaum, M., Brady, J., Bruck, J., Menon, J.: EVENODD: An efficient scheme for tolerating double disk failures in raid architectures. IEEE Trans. Comput. 44(2), 192\u2013202 (1995)","journal-title":"IEEE Trans. Comput."},{"key":"134_CR5","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/18.485722","volume":"42","author":"M Blaum","year":"1996","unstructured":"Blaum, M., Bruck, J., Vardy, E.: MDS array codes with independent parity symbols. IEEE Trans. Inf. Theory 42, 529\u2013542 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"134_CR6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/18.179343","volume":"39","author":"M Blaum","year":"1993","unstructured":"Blaum, M., Roth, R.M.: New array codes for multiple phased burst correction. IEEE Trans. Inf. Theory 39(1), 66\u201377 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"134_CR7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/18.746771","volume":"45","author":"M Blaum","year":"1999","unstructured":"Blaum, M., Roth, R.M.: On lowest-density MDS codes. IEEE Trans. Inf. Theory 45, 46\u201359 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"134_CR8","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426\u2013434 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"134_CR9","doi-asserted-by":"crossref","first-page":"3279","DOI":"10.1109\/TIT.2014.2313720","volume":"60","author":"Y Cassuto","year":"2014","unstructured":"Cassuto, Y., Shokrollahi, A.: Ldpc codes for 2d arrays. Information Theory, IEEE Transactions on 60(6), 3279\u20133291 (2014)","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"4","key":"134_CR10","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1109\/TIT.2009.2013024","volume":"55","author":"Yuval Cassuto","year":"2009","unstructured":"Cassuto, Yuval, Bruck, Jehoshua: Cyclic lowest density mds array codes. IEEE Trans. Inf. Theor. 55(4), 1721\u20131729 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"9","key":"134_CR11","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1109\/TC.2005.150","volume":"54","author":"GL Feng","year":"2005","unstructured":"Feng, G.L., Deng, R.H., Bao, F., Shen, J.C.: New efficient MDS array codes for RAID. Part I. Reed-Solomon-like codes for tolerating three disk failures. IEEE Trans. Comput. 54(9), 1071\u20131080 (2005)","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"134_CR12","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1109\/TC.2005.200","volume":"54","author":"GL Feng","year":"2005","unstructured":"Feng, G.L., Deng, R.H., Bao, F., Shen, J.C.: New efficient MDS array codes for RAID. Part II. Rabin-like codes for tolerating multiple (\u22654) disk failures. IEEE Trans. Comput. 54(12), 1473\u20131483 (2005)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"134_CR13","first-page":"197","volume":"19","author":"NV Semakov","year":"1983","unstructured":"Semakov, N.V., Zaitsev, G.V., Zinov\u2019ev, V.A.: Minimum-check-density codes for correcting bytes of errors, erasures, or defects. Probl. Inf. Transm. 19(3), 197\u2013204 (1983)","journal-title":"Probl. Inf. Transm."},{"key":"134_CR14","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low density Parity Check Codes. MIT Press (1963)","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"134_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-1-4613-0283-4_13","volume":"3","author":"JWP Hirschfeld","year":"2000","unstructured":"Hirschfeld, J.W.P., Storme, L., et al.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. Developments in Mathematics 3, 201\u2013246 (2000)","journal-title":"Developments in Mathematics"},{"key":"134_CR16","unstructured":"Huang, C., Xu, L.: STAR: an efficient coding scheme for correcting triple storage node failures. In: FAST, pages 197\u2013210 (2005)"},{"key":"134_CR17","unstructured":"Kounias, S., Petros, CI: Orthogonal arrays of strength three and four with index unity. Sankhy\u0101: The Indian Journal of Statistics Series B, 228\u2013240 (1975)"},{"issue":"7","key":"134_CR18","doi-asserted-by":"crossref","first-page":"3186","DOI":"10.1109\/TIT.2006.876235","volume":"52","author":"E Louidor","year":"2006","unstructured":"Louidor, E., Roth, R.M.: Lowest density MDS codes over extension alphabets. IEEE Trans. Inf. Theor. 52(7), 3186\u20133197 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"134_CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"134_CR20","doi-asserted-by":"crossref","unstructured":"Luby, M.: LT codes. In: Proc. FOCS, pages 271\u2013280 (2002)","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"134_CR21","doi-asserted-by":"crossref","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, M., Spielman, D., Stemann, V.: Practical loss-resilient codes. In: Proc. 29th ACM STOC, pages 150\u2013159. ACM (1997)","DOI":"10.1145\/258533.258573"},{"key":"134_CR22","unstructured":"Luby, M.G., Mitzenmacher, M., Amin Shokrollahi, M.: Analysis of random processes via and-or tree evaluation. In: In Proc 9th Annual ACM-SIAM SODA, 364\u2013373 (1998)"},{"key":"134_CR23","doi-asserted-by":"crossref","unstructured":"MacKay, D., Neal, R.: Good codes based on very sparse matrices. Cryptography and Coding, 100\u2013111 (1995)","DOI":"10.1007\/3-540-60693-9_13"},{"issue":"2","key":"134_CR24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC MacKay","year":"1999","unstructured":"MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Infor. Theory 45(2), 399\u2013431 (1999)","journal-title":"IEEE Trans. Infor. Theory"},{"key":"134_CR25","unstructured":"MacKay, D.J.C.: Information theory, inference and learning algorithms. Cambridge university press (2003)"},{"key":"134_CR26","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. NH Pub. Company (1978)"},{"key":"134_CR27","first-page":"325","volume":"9","author":"G Margulis","year":"1975","unstructured":"Margulis, G.: Explicit construction of concentrators. Probl. Inform. transm. 9, 325\u2013332 (1975)","journal-title":"Probl. Inform. transm."},{"issue":"1","key":"134_CR28","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"GA Margulis","year":"1982","unstructured":"Margulis, G.A.: Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2(1), 71\u201378 (1982)","journal-title":"Combinatorica"},{"key":"134_CR29","unstructured":"MinT: Bound for oas with index unity, URL http:\/\/mint.sbg.ac.at\/desc_CBoundT0.html (2012)"},{"key":"134_CR30","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"134_CR31","doi-asserted-by":"crossref","unstructured":"Roth, R.: Introduction to coding theory. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511808968"},{"issue":"6","key":"134_CR32","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Trans. on Inform. Theory 52(6), 2551\u20132567 (2006)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"6","key":"134_CR33","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.: Expander codes. IEEE Trans. Infor. Theo. 42(6), 1710\u20131722 (1996)","journal-title":"IEEE Trans. Infor. Theo."},{"issue":"6","key":"134_CR34","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"DA Spielman","year":"1996","unstructured":"Spielman, D.A., Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"134_CR35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0304-3975(98)00119-4","volume":"237","author":"Yongge Wang","year":"2000","unstructured":"Wang, Yongge: Resource bounded randomness and computational complexity. Theoret. Comput. Sci. 237, 33\u201355 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"134_CR36","unstructured":"Wang, Yongge: Insecure \u201cprovably\u201d secure network coding and homomorphic authentication sechemes for network coding, Available at http:\/\/coitweb.uncc.edu\/yonwang\/papers\/ncattack.pdf (2010)"},{"key":"134_CR37","doi-asserted-by":"crossref","unstructured":"Wang, Yongge: Array BP-XOR codes for reliable cloud storage systems. In: Proc IEEE ISIT 2013, pages 326\u2013330. IEEE Press (2013)","DOI":"10.1109\/ISIT.2013.6620241"},{"key":"134_CR38","doi-asserted-by":"crossref","unstructured":"Wang, Yongge : Privacy-preserving data storage in cloud using array BP-XOR codes, IEEE Trandactions on Cloud Computing (2015)","DOI":"10.1109\/TCC.2014.2344662"},{"issue":"13","key":"134_CR39","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.ipl.2011.03.017","volume":"111","author":"Yongge Wang","year":"2011","unstructured":"Wang, Yongge, Desmedt, Yvo: Edge-colored graphs with applications to homogeneous faults. Inf. Process. Lett. 111(13), 634\u2013641 (2011)","journal-title":"Inf. Process. Lett."},{"key":"134_CR40","doi-asserted-by":"crossref","unstructured":"Wang, Yongge, Desmedt, Yvo: Homogeneous faults, colored edge graphs, and cover free families. In: ICITS, pages 58\u201372 (2011)","DOI":"10.1007\/978-3-642-20728-0_6"},{"key":"134_CR41","unstructured":"Wang, Z.: Private communication (2014)"},{"key":"134_CR42","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1109\/18.782102","volume":"45","author":"L Xu","year":"1998","unstructured":"Xu, L., Bohossian, V., Bruck, J., Wagner, D.: Low density mds codes and factors of complete graphs. IEEE Trans. Inf. Theor. 45, 1817\u20131826 (1998)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"134_CR43","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/18.746809","volume":"45","author":"L Xu","year":"1999","unstructured":"Xu, L., Bruck, J.: X-code: Mds array codes with optimal encoding. IEEE Trans. on Information Theory 45, 272\u2013276 (1999)","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0134-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-015-0134-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0134-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T12:53:50Z","timestamp":1566651230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-015-0134-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,3]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["134"],"URL":"https:\/\/doi.org\/10.1007\/s12095-015-0134-9","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,3]]}}}