{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:17:10Z","timestamp":1649215030156},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:00:00Z","timestamp":1573862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:00:00Z","timestamp":1573862400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11786-019-00416-5","type":"journal-article","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T08:01:53Z","timestamp":1573891313000},"page":"415-421","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of Abelian Codes Multiplying Dimension of Cyclic Codes"],"prefix":"10.1007","volume":"14","author":[{"given":"Jos\u00e9 Joaqu\u00edn","family":"Bernal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diana H.","family":"Bueno-Carre\u00f1o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Jacobo","family":"Sim\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,16]]},"reference":[{"issue":"2","key":"416_CR1","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/TIT.2015.2512594","volume":"62","author":"JJ Bernal","year":"2016","unstructured":"Bernal, J.J., Bueno-Carre\u00f1o, D.H., Sim\u00f3n, J.J.: Apparent distance and a notion of BCH multivariate codes. IEEE Trans. Inf. Theory 62(2), 655\u2013668 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"416_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.3934\/amc.2016018","volume":"10","author":"JJ Bernal","year":"2016","unstructured":"Bernal, J.J., Bueno-Carre\u00f1o, D.H., Sim\u00f3n, J.J.: Cyclic and BCH codes whose minimum distance equals their maximum BCH bound. Adv. Math. Commun. 10, 459\u2013474 (2016)","journal-title":"Adv. Math. Commun."},{"key":"416_CR3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868446","author":"JJ Bernal","year":"2018","unstructured":"Bernal, J.J., Guerreiro, M., Sim\u00f3n, J.J.: From ds-bounds for cyclic codes to true minimum distance for abelian codes. IEEE Trans. Inf. Theory. (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2868446","journal-title":"IEEE Trans. Inf. Theory."},{"key":"416_CR4","unstructured":"Camion, P.: Abelian Codes. MRC Tech. Sum. Rep. # 1059, University of Wisconsin (1971)"},{"issue":"1","key":"416_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(77)90232-7","volume":"34","author":"H Imai","year":"1977","unstructured":"Imai, H.: A theory of two-dimensional cyclic codes. Inf. Control 34(1), 1\u201321 (1977)","journal-title":"Inf. Control"},{"key":"416_CR6","doi-asserted-by":"crossref","unstructured":"Jensen, J.M.: The concatenated structure of cyclic and abelian codes. IEEE Trans. Inf. Theory IT-31, 788\u2013793 (1985)","DOI":"10.1109\/TIT.1985.1057109"},{"key":"416_CR7","unstructured":"Laijin, Y., Ming, L.: Design and implementation of RS(255,223) decoder on FPGA. In: Proceeding of the Sixth IEEE CPMT Conference on High Density Microsystem Design and Packaging and Component Failure Analysis. HDP \u201904, Shanghai, China, 30 June\u20133 July (2004)"},{"key":"416_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"FJ Macwilliams","year":"1977","unstructured":"Macwilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"416_CR9","volume-title":"On Minimum Distance Bounds for Abelian Codes, Applicable Algebra in Engineering Communication and Computing","author":"RE Sabin","year":"1992","unstructured":"Sabin, R.E.: On Minimum Distance Bounds for Abelian Codes, Applicable Algebra in Engineering Communication and Computing. Springer, New York (1992)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-019-00416-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-019-00416-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-019-00416-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T00:13:22Z","timestamp":1605399202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-019-00416-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,16]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s11786-019-00416-5","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,16]]},"assertion":[{"value":"24 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}