{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:10:37Z","timestamp":1648793437028},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,10]],"date-time":"2014-01-10T00:00:00Z","timestamp":1389312000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10623-013-9905-5","type":"journal-article","created":{"date-parts":[[2014,1,9]],"date-time":"2014-01-09T00:42:24Z","timestamp":1389228144000},"page":"315-334","source":"Crossref","is-referenced-by-count":2,"title":["Generalized residue and t-residue codes and their idempotent generators"],"prefix":"10.1007","volume":"75","author":[{"given":"A. J.","family":"van Zanten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Bojilov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Dodunekov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,10]]},"reference":[{"key":"9905_CR1","doi-asserted-by":"crossref","unstructured":"Arora S.K., Pruthi M.: Minimal cyclic codes of length $$2p^{n}$$ 2 p n . Finite Fields Appl. 5, 177\u2013187 (1999).","DOI":"10.1006\/ffta.1998.0238"},{"key":"9905_CR2","doi-asserted-by":"crossref","unstructured":"Arora S.K., Batra S., Cohen S.D., Pruthi M.: The primitive idempotents of a cyclic group algebra. South East Asian Bull. Math. 26, 549\u2013557 (2002).","DOI":"10.1007\/s100120200058"},{"key":"9905_CR3","doi-asserted-by":"crossref","unstructured":"Bakshi G.K., Raka M.: Minimal cyclic codes of length $$p^{n}q$$ p n q . Finite Fields Appl. 9, 432\u2013448 (2003).","DOI":"10.1016\/S1071-5797(03)00023-6"},{"key":"9905_CR4","unstructured":"Batra S., Arora S.K.: Minimal qudratic residue cyclic codes of length $$p^{n}$$ p n ( $$p$$ p odd prime). Korean J. Comput. Appl. Math. 8, 531\u2013547 (2001)."},{"key":"9905_CR5","doi-asserted-by":"crossref","unstructured":"Batra S., Arora S.K.: Some cyclic codes of length $$2p^{n}$$ 2 p n . Des. Codes Cryptogr. 61, 41\u201369 (2011).","DOI":"10.1007\/s10623-010-9438-0"},{"key":"9905_CR6","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)."},{"key":"9905_CR7","doi-asserted-by":"crossref","unstructured":"Brualdi R.A., Pless V.S.: Polyadic codes. Discret. Appl. Math. 25, 3\u201317 (1989).","DOI":"10.1016\/0166-218X(89)90042-5"},{"key":"9905_CR8","doi-asserted-by":"crossref","unstructured":"Camion P.: Global quadratic abelian codes. In: Longo G. (ed.) Information Theory, CISM Courses and Lectures, vol. 219. Springer, Wien (1975).","DOI":"10.1007\/978-3-7091-2730-8_11"},{"key":"9905_CR9","doi-asserted-by":"crossref","unstructured":"Delsarte P.: Majority logic decodable codes derived from finite inversive planes. Inf. Control 18, 319\u2013325 (1971).","DOI":"10.1016\/S0019-9958(71)90428-1"},{"key":"9905_CR10","unstructured":"Dodunekov S.M.: Residual codes. Plisca Stud. Math. Bulg. 2, 3\u20135 (1981)."},{"key":"9905_CR11","unstructured":"Dodunekov S.M., Bojilov A., van Zanten A.J.: Generalized residue codes, TR 2010-001. TiCC, Tilburg University. http:\/\/www.tilburguniversity.edu\/research\/institutes-and-research-groups\/ticc\/research-programs\/cc\/technical-reports ."},{"key":"9905_CR12","unstructured":"Dodunekov S.M., Bojilov A., van Zanten A.J.: Generalized residue codes and their idempotent generators, TR 2011-001. TiCC, Tilburg University. http:\/\/www.tilburguniversity.edu\/research\/institutes-and-research-groups\/ticc\/research-programs\/cc\/technical-reports ."},{"key":"9905_CR13","doi-asserted-by":"crossref","unstructured":"Ferraz R.A., Milies C.P.: Idempotents in group algebras and minimal abelian codes. Finite Fields Appl. 13, 382\u2013393 (2007).","DOI":"10.1016\/j.ffa.2005.09.007"},{"key":"9905_CR14","doi-asserted-by":"crossref","unstructured":"Huffman W.C.: The automorphism groups of the generalized quadratic residue codes. IEEE Trans. Inf. Theory 41, 378\u2013386 (1995).","DOI":"10.1109\/18.370139"},{"key":"9905_CR15","unstructured":"Ireland K., Rosen M.: A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics, vol. 84. Springer, New York (1980)."},{"key":"9905_CR16","doi-asserted-by":"crossref","unstructured":"Leon J.S., Masley J.M., Pless V.: Duadic codes. IEEE Trans. Inf. Theory 30, 709\u2013714 (1984).","DOI":"10.1109\/TIT.1984.1056944"},{"key":"9905_CR17","unstructured":"Lidl R.L., Niederreiter H.: Introduction to Finite Fields and Their Applications, revised edn. Cambridge University Press, Cambridge (1997)."},{"key":"9905_CR18","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)."},{"key":"9905_CR19","doi-asserted-by":"crossref","unstructured":"Pless V.: Q-codes. J. Comb. Theory A 43, 258\u2013276 (1986).","DOI":"10.1016\/0097-3165(86)90066-X"},{"key":"9905_CR20","unstructured":"Pless V.: Introduction to the Theory of Error-Correcting Codes, 2nd edn. Wiley Interscience, New York (1990)."},{"key":"9905_CR21","doi-asserted-by":"crossref","unstructured":"Pless V., Rushanan J.J.: Triadic codes. Linear Algebra Appl. 98, 415\u2013433 (1988).","DOI":"10.1016\/0024-3795(88)90174-7"},{"key":"9905_CR22","doi-asserted-by":"crossref","unstructured":"Pruthi M., Arora S.K.: Minimal codes of prime-power length. Finite Fields Appl. 3, 99\u2013113 (1997).","DOI":"10.1006\/ffta.1996.0156"},{"key":"9905_CR23","doi-asserted-by":"crossref","unstructured":"Sharma A., Bakshi G.K., Raka M.: Polyadic codes of prime power length. Finite Fields Appl. 13, 1071\u20131085 (2007).","DOI":"10.1016\/j.ffa.2006.12.006"},{"key":"9905_CR24","doi-asserted-by":"crossref","unstructured":"Smid M.H.M.: Duadic codes. IEEE Trans. Inf. Theory 33, 432\u2013433 (1987).","DOI":"10.1109\/TIT.1987.1057300"},{"key":"9905_CR25","doi-asserted-by":"crossref","unstructured":"van Lint J.H.: Coding Theory. Springer, New York (1971).","DOI":"10.1007\/978-3-662-20712-3"},{"key":"9905_CR26","unstructured":"van Lint J.H.: Generalized Quadratic Residue Codes. Lecture Notes. Department of Mathematics, Eindhoven University of Technology, Eindhoven (1992)."},{"key":"9905_CR27","doi-asserted-by":"crossref","unstructured":"van Lint J.H., MacWilliams F.J.: Generalized quadratic residue codes. IEEE Trans. Inf. Theory 24, 730\u2013737 (1978).","DOI":"10.1109\/TIT.1978.1055965"},{"key":"9905_CR28","unstructured":"van Zanten A.J., Bojilov A., Dodunekov S.M.: Idempotent generators of generalized residue codes. In: Proceedings of the Twelfth International Workshop of the Algebraic and Combinatorial Coding Theory (ACCT), Akademgorodok, Novosibirsk, pp. 304\u2013309 (2010)."},{"key":"9905_CR29","unstructured":"van Zanten A.J., Bojilov A., Dodunekov S.M.: Idempotent generators of generalized and double generalized quadratic residue codes, TR 2011-002. TiCC, Tilburg University. http:\/\/www.tilburguniversity.edu\/research\/institutes-and-research-groups\/ticc\/research-programs\/cc\/technical-reports ."},{"key":"9905_CR30","doi-asserted-by":"crossref","unstructured":"Ward H.N.: Qudratic residue codes and symplectic groups. J. Algebra 29, 150\u2013171 (1974).","DOI":"10.1016\/0021-8693(74)90120-3"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9905-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9905-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9905-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:37Z","timestamp":1559231917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9905-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,10]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9905"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9905-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,10]]}}}