{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:25:32Z","timestamp":1773260732915,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10623-018-0495-0","type":"journal-article","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T09:31:06Z","timestamp":1531128666000},"page":"1199-1225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Primitive idempotent tables of cyclic and constacyclic codes"],"prefix":"10.1007","volume":"87","author":[{"given":"A. J.","family":"van Zanten","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"495_CR1","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ffa.2011.09.005","volume":"18","author":"GK Bakshi","year":"2012","unstructured":"Bakshi G.K., Raka M.: A class of constacyclic codes over a Finite Field. Finite Fields Appl. 18, 362\u2013377 (2012).","journal-title":"Finite Fields Appl."},{"key":"495_CR2","volume-title":"Algebraic Coding Theory","author":"E Berlekamp","year":"1968","unstructured":"Berlekamp E.: Algebraic Coding Theory. Mc Graw-Hill book Company, New York (1968)."},{"key":"495_CR3","first-page":"21","volume":"3","author":"SD Berman","year":"1967","unstructured":"Berman S.D.: Semisimple cyclic and abelian codes. Kibernetika 3, 21\u201330 (1967).","journal-title":"Kibernetika"},{"key":"495_CR4","volume-title":"Algebraic Coding Theory","author":"J Bierbrauer","year":"2005","unstructured":"Bierbrauer J.: Algebraic Coding Theory. Chapman and Hall, Boca Raton (2005)."},{"key":"495_CR5","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.ffa.2012.10.001","volume":"18","author":"B Chen","year":"2012","unstructured":"Chen B., Fan Y., Lin L., Liu H.: Constacyclic codes over finite fields. Finite Fields Appl. 18, 1217\u20131231 (2012).","journal-title":"Finite Fields Appl."},{"key":"495_CR6","volume-title":"Reiner I: Representation Theory of Finite Groups and Associative Algebras","author":"CW Curtis","year":"1962","unstructured":"Curtis C.W.: Reiner I: Representation Theory of Finite Groups and Associative Algebras. Interscience, New York (1962)."},{"key":"495_CR7","volume-title":"Group Representation Theory.Part A and B","author":"L Dornhoff","year":"1972","unstructured":"Dornhoff L.: Group Representation Theory.Part A and B. Marcel Dekking Inc., New York (1972)."},{"key":"495_CR8","series-title":"SpringerBriefs in Mathematics","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-59806-2_6","volume-title":"Algebraic Coding Theory over Finite Commutative Rings","author":"ST Dougherty","year":"2017","unstructured":"Dougherty S.T.: Cyclic and constacyclic codes. In: Dougherty S.T. (ed.) Algebraic Coding Theory over Finite Commutative Rings, pp. 83\u2013100. SpringerBriefs in MathematicsSpringer, Cham (2017)."},{"key":"495_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10623-016-0282-8","volume":"84","author":"Y Fan","year":"2017","unstructured":"Fan Y., Zhang L.: Galois self dual codes. Des. Codes Cryptogr. 84, 473\u2013493 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"495_CR10","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ffa.2005.09.007","volume":"13","author":"RA Ferraz","year":"2007","unstructured":"Ferraz R.A., Milies C.P.: Idempotents in group algebras and minimal abelian codes. Finite Fields Appl. 13, 382\u2013393 (2007).","journal-title":"Finite Fields Appl."},{"key":"495_CR11","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/18.825841","volume":"46","author":"G Hughes","year":"2000","unstructured":"Hughes G.: Constacyclic codes, cocycles and u\u00a0+\u00a0v|u\u00a0\u2212\u00a0v construction. IEEE Trans. Inf. Theory 46, 674\u2013680 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"495_CR12","doi-asserted-by":"publisher","first-page":"2995","DOI":"10.1109\/18.959277","volume":"47","author":"G Hughes","year":"2001","unstructured":"Hughes G.: A Vandermonde code construction. IEEE Trans. Inf. Theory 47, 2995\u20132998 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"495_CR13","volume-title":"Character Theory of Finite Groups","author":"IM Isaacs","year":"1976","unstructured":"Isaacs I.M.: Character Theory of Finite Groups. Acadamic Press Inc., New York (1976)."},{"key":"495_CR14","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/18.335910","volume":"40","author":"J Jensen","year":"1994","unstructured":"Jensen J.: A class of constacyclic codes. IEEE Trans. Inf. Theory 40, 951\u2013954 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"495_CR15","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1109\/TIT.2002.801473","volume":"48","author":"S Lang","year":"2002","unstructured":"Lang S., Blackford T.: \n                    \n                      \n                    \n                    $$ Z_{{p^{{k + 1}} }} $$\n                    \n                      \n                        \n                          Z\n                          \n                            p\n                            \n                              k\n                              +\n                              1\n                            \n                          \n                        \n                      \n                    \n                  -Linear codes. IEEE Trans. Inf. Theory 48, 2592\u20132605 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"495_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0356-2","author":"F Li","year":"2017","unstructured":"Li F., Yue Q.: The primitive idempotents and weight distributions of irreducible constacyclic codes. Des. Codes Cryptogr. (2017). \n                    https:\/\/doi.org\/10.1007\/s10623-017-0356-2\n                    \n                  .","journal-title":"Des. Codes Cryptogr."},{"key":"495_CR17","volume-title":"Introduction to Finite Fields and their Applications","author":"RL Lidl","year":"1997","unstructured":"Lidl R.L., Niederreiter H.: Introduction to Finite Fields and their Applications, rev edn. Cambridge University Press, Cambridge (1997).","edition":"rev"},{"key":"495_CR18","volume-title":"The Theory of Error Correcting Codes","author":"FJ Mac Williams","year":"1977","unstructured":"Mac Williams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977)."},{"key":"495_CR19","volume-title":"Introduction to the Theory of Error-Correcting Codes","author":"V Pless","year":"1990","unstructured":"Pless V.: Introduction to the Theory of Error-Correcting Codes, 2nd edn. Wiley, New York (1990).","edition":"2"},{"key":"495_CR20","unstructured":"Radkova D.: Constacyclic Codes as Invariant Subspaces, Dissertation. Delft University of Technology, Delft. ISBN 978-90-9023852-4 (2009)."},{"key":"495_CR21","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.laa.2008.09.036","volume":"430","author":"D Radkova","year":"2009","unstructured":"Radkova D., van Zanten A.J.: Constacyclic codes as invariant subspaces. Linear Algebra Appl. 430, 855\u2013864 (2009).","journal-title":"Linear Algebra Appl."},{"key":"495_CR22","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ffa.2004.01.005","volume":"10","author":"A Sharma","year":"2004","unstructured":"Sharma A., Bakshi G.K., Dumir V.C., Raka M.: Cyclotomic numbers and primitive idempotents in the ring \n                    \n                      \n                    \n                    $$ GF\\left( q \\right)[x\\} \/\\left( {x^{{p^{n} }} {-}~1} \\right) $$\n                    \n                      \n                        \n                          G\n                          F\n                          \n                            q\n                          \n                          \n                            [\n                            x\n                            }\n                          \n                          \/\n                          \n                            \n                              \n                                x\n                                \n                                  p\n                                  n\n                                \n                              \n                              -\n                              \n                              1\n                            \n                          \n                        \n                      \n                    \n                  . Finite Fields Appl. 10, 653\u2013673 (2004).","journal-title":"Finite Fields Appl."},{"key":"495_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.ffa.2010.10.005","volume":"17","author":"I Gelder van","year":"2011","unstructured":"van Gelder I., Olteanu G.: Finite group algebras of nilpotent groups: a complete set of orthogonal primitive idempotents. Finite Fields Appl. 17, 157\u2013165 (2011).","journal-title":"Finite Fields Appl."},{"key":"495_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-20712-3","volume-title":"Coding Theory","author":"JH Lint van","year":"1971","unstructured":"van Lint J.H.: Coding Theory. Springer, New York (1971)."},{"key":"495_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10623-013-9905-5","volume":"75","author":"AJ Zanten van","year":"2015","unstructured":"van Zanten A.J., Bojilov A., Dodunekov S.M.: Generalized residue and t-residue codes and their idempotent generators. Des. Codes Crypt. 75, 315\u2013334 (2015).","journal-title":"Des. Codes Crypt."},{"key":"495_CR26","unstructured":"van Zanten A.J.: Negacyclotomic cosets and negacyclonomials of negacyclic codes, TR 2015, TiCC, Tilburg University. \n                    http:\/\/www.tilburguniversity.edu\/research\/institutes-and-research-programs\/cc\/technical-reports\n                    \n                  ."},{"key":"495_CR27","unstructured":"van Zanten A.J.: Orthogonality and conjugation for the idempotents of constacyclic codes, TR 2016, TiCC, Tilburg University. \n                    http:\/\/www.tilburguniversity.edu\/research\/institutes-and-research-programs\/cc\/technical-reports\n                    \n                  ."},{"key":"495_CR28","unstructured":"Wu Y., Li F.: Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings. Discret. Math. (in press)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0495-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0495-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0495-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T16:27:56Z","timestamp":1567182476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0495-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["495"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0495-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"24 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}