{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:49Z","timestamp":1725663109536},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167679"},{"type":"electronic","value":"9783540388135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16767-6_48","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:55:27Z","timestamp":1330196127000},"page":"25-35","source":"Crossref","is-referenced-by-count":2,"title":["Construction of primitive idempotents for a variable codes"],"prefix":"10.1007","author":[{"given":"A.","family":"Poli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"2\u20133","key":"2_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(85)90016-0","volume":"56","author":"T. Beth","year":"1985","unstructured":"T. Beth \"Generalizing the Discrete Fourier Transform\" Discrete Math., vol. 56, no2\u20133, pp 95\u2013101, 1985.","journal-title":"Discrete Math."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"P.Camion \"Improving an algorithm for factoring polynomials over a finite field and constructing large irred.pomyn.\" IEEE Trans. on Inf. Theory,vol. IT29,no3,May 1985.","DOI":"10.1109\/TIT.1983.1056666"},{"key":"2_CR3","first-page":"55","volume":"12","author":"P. Camion","year":"1982","unstructured":"P. Camion \"Un algorithme de construction des idempotents primitifs d'id\u00e9aux d'alg\u00e8bre sur IFp\". Annals of Discrete Math., vol.12, pp55\u201363, 1982.","journal-title":"Annals of Discrete Math."},{"key":"2_CR4","unstructured":"P.Camion \"Un algorithme de construction des idempotents primitifs d'id\u00e9aux sur IFq\" C.R.A.S. Paris, t291, serie A (1980)."},{"key":"2_CR5","unstructured":"H.F. De Groote,J.Heintz \"Commutative algebras of minimal rank\" (preprint)."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(77)90232-7","volume":"34","author":"H. Imai","year":"1977","unstructured":"H. Imai \"A theory of two dimensional cyclic codes\" Inf. and Control 34,pp1\u201334, 1977.","journal-title":"Inf. and Control"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"H.T.Kung, D.M.Tong \"Fast algorithms for partial fraction decomp.\" S.I.A.M. J. Comp., vol.6,no3, 1977.","DOI":"10.1137\/0206042"},{"key":"2_CR8","unstructured":"J.P.Lafon \"Alg\u00e8bre commutative T2\" Chez Hermann, 1977."},{"key":"2_CR9","first-page":"131","volume":"38\u201339","author":"D. Lazard","year":"1976","unstructured":"D. Lazard \"Algorithmes fondamentaux en Alg\u00e8bre commutative\" Ast\u00e9risque 38\u201339,pp131\u2013138, 1976.","journal-title":"Ast\u00e9risque"},{"key":"2_CR10","unstructured":"M.P.Malliavin \"Les groupes finis et leurs repr\u00e9sentations complexes\". Chez Masson, 1981."},{"issue":"2\u20133","key":"2_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(85)90032-9","volume":"56","author":"A. Poli","year":"1985","unstructured":"A. Poli \"Important algebraic calculations for n variable polynomial codes\" Discrete Math.,vol.56,no2\u20133,pp255\u2013265,1985.","journal-title":"Discrete Math."},{"key":"2_CR12","unstructured":"A.Poli \"Codes dans certaines alg\u00e8bres modulaires\" Th\u00e8se d'Etat, Univ.P.Sabatier,Toulouse,F,1978."},{"key":"2_CR13","unstructured":"A.Poli \"Quelques r\u00e9sultats sur les codes polynomiaux \u00e0 n variables\". Revue du CETHEDEC, 4\u00e8me Trim.,NS 81\u20132,pp23\u201333, 1981."},{"issue":"2\u20133","key":"2_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(85)90034-2","volume":"56","author":"C. Rigoni","year":"1985","unstructured":"C. Rigoni \"Construction of n variable codes\". Disc. Math., vol.56,no2\u20133,pp 275\u2013281, 1985.","journal-title":"Disc. Math."},{"key":"2_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-36657-7","volume-title":"Coding Theory","author":"J. H. Lint Van","year":"1973","unstructured":"J.H. Van Lint \"Coding Theory\" Springer Verlag (New York), 1973."},{"key":"2_CR16","unstructured":"M.Ventou \"Contribution \u00e0 l'\u00e9tude des codes polynomiaux\". Th\u00e8se de sp\u00e9cialite,Univ.P.Sabatier,Toulouse,F, 1984."},{"key":"2_CR17","volume-title":"Modern Algebra","author":"B. L. Waerden Van der","year":"1964","unstructured":"B.L. Van der Waerden \"Modern Algebra\" F.Ungar Pub. Co., New York, 1964."},{"key":"2_CR18","unstructured":"F.J.MacWilliams,N.J.A.Sloane \"The theory of Error Corr. codes\" North Holland P.Co., 1977."},{"key":"2_CR19","unstructured":"F.Winkler,B.Buchberger,F.Lichtenberger,H.Rolletschek \"An algorithm for constructing canonical bases (Grobner bases) of polynomial ideals\". CAMP.Publ.,no81\u201310,Sept.1981."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algorithmics and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16767-6_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:12Z","timestamp":1605643872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16767-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167679","9783540388135"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-16767-6_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}