{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T00:06:16Z","timestamp":1709424376753},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,3,1]]},"DOI":"10.1587\/transfun.2023tap0011","type":"journal-article","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T22:15:57Z","timestamp":1691619357000},"page":"476-485","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Construction of Encoding Polynomials in a Distributed Coded Computing Scheme"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Daisuke","family":"HIBINO","sequence":"first","affiliation":[{"name":"Graduate School of Science and Technology, Sophia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoharu","family":"SHIBUYA","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Sciences, Sophia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] A. Bostan and \u00c9. Schost, \u201cPolynomial evaluation and interpolation on special sets of points,\u201d Journal of Complexity, vol.21, no.4, pp.420-426, 2005. 10.1016\/j.jco.2004.09.009","DOI":"10.1016\/j.jco.2004.09.009"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] S. Dutta, V. Cadambe, and P. Grover, \u201cCoded convolution for parallel and distributed computing within a deadline,\u201d Proc. 2017 IEEE International Symposium on Information Theory (ISIT), pp.2403-2407, 2017. 10.1109\/isit.2017.8006960","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[4] Z. Jia and S.A. Jafar, \u201cCross subspace alignment codes for coded distributed batch computation,\u201d IEEE Trans. Inf. Theory, vol.67, no.5, pp.2821-2846, 2021. 10.1109\/tit.2021.3064827","DOI":"10.1109\/TIT.2021.3064827"},{"key":"4","unstructured":"[5] J. Justesen and T. H\u00f8 holdt, A Course In Error-Correcting Codes, European Mathematical Society, 2005. 10.4171\/001"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[6] J. Kapusta and R. Smarzewski, \u201cFast algorithms for multivariable interpolation and evaluation at special points,\u201d Journal of Complexity, vol.25, no.4, pp.332-338, 2009. 10.1016\/j.jco.2009.02.001","DOI":"10.1016\/j.jco.2009.02.001"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, \u201cSpeeding up distributed machine learning using codes,\u201d IEEE Trans. Inf. Theory, vol.64, no.3, pp.1514-1529, 2018. 10.1109\/TIT.2017.2736066","DOI":"10.1109\/TIT.2017.2736066"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] S. Li, M.A. Maddah-Ali, and A.S. Avestimehr, \u201cA unified coding framework for distributed computing with straggling servers,\u201d Proc. 2016 IEEE Globecom Workshops, pp.1-6, 2016. 10.1109\/glocomw.2016.7848828","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[9] G. Mastroianni and G.V. Milovanovi\u0107, Interpolation Processes, Springer, 2008. 10.1007\/978-3-540-68349-0","DOI":"10.1007\/978-3-540-68349-0"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] M. Soleymani, R.E. Ali, H. Mahdavifar, and A.S. Avestimehr, \u201cList-decodable coded computing: Breaking the adversarial toleration barrier,\u201d IEEE J. Sel. Areas Inf. Theory, vol.2, no.3, pp.867-878, 2021. 10.1109\/jsait.2021.3102956","DOI":"10.1109\/JSAIT.2021.3102956"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] M. Soleymani, H. Mahdavifar, and A.S. Avestimehr, \u201cAnalog lagrange coded computing,\u201d IEEE J. Sel. Areas Inf. Theory, vol.2, no.1, pp.283-295, 2021. 10.1109\/jsait.2021.3056377","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] G. Tel, Introduction to Distributed Algorithms, 2nd ed., Cambridge University Press, 2000. 10.1017\/cbo9781139168724","DOI":"10.1017\/CBO9781139168724"},{"key":"12","unstructured":"[13] Q. Yu, M.A. Maddah-Aliy, and A.S. Avestimehr, \u201cPolynomial codes: An optimal design for high-dimensional coded matrix multiplication,\u201d Proc. 31st Conference on Neural Information Processing Systems (NIPS 2017), pp.4406-4416, 2017"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[14] Q. Yu, M.A. Maddah-Aliy, and A.S. Avestimehr, \u201cStraggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,\u201d IEEE Trans. Inf. Theory, vol.66, no.3, pp.1920-1933, 2020. 10.1109\/TIT.2019.2963864","DOI":"10.1109\/TIT.2019.2963864"},{"key":"14","unstructured":"[15] Q. Yu, S. Li, N. Raviv, S. Mohammadreza, M. Kalan, M. Soltanolkotabi, and A.S. Avestimehr, \u201cLagrange coded computing: Optimal design for resiliency, security, and privacy,\u201d arXiv:1806.00939, 2019. 10.48550\/arXiv.1806.00939"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] J. Zhu, H. Tang, S. Li, and Y. Chang, \u201cGeneralized lagrange coded computing: A flexible computation-communication tradeoff for resilient, secure, and private computation,\u201d arXiv:2204.11168v2, 2023. 10.48550\/arXiv.2204.11168","DOI":"10.1109\/ISIT50566.2022.9834535"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/3\/E107.A_2023TAP0011\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T03:29:49Z","timestamp":1709350189000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/3\/E107.A_2023TAP0011\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023tap0011","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"article-number":"2023TAP0011"}}