{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T07:11:07Z","timestamp":1717312267849},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,5]],"date-time":"2013-07-05T00:00:00Z","timestamp":1372982400000},"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,2]]},"DOI":"10.1007\/s10623-013-9857-9","type":"journal-article","created":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T04:42:30Z","timestamp":1372912950000},"page":"285-300","source":"Crossref","is-referenced-by-count":22,"title":["A class of minimal cyclic codes over finite fields"],"prefix":"10.1007","volume":"74","author":[{"given":"Bocong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Guanghui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,5]]},"reference":[{"key":"9857_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":"9857_CR2","unstructured":"Arora S.K., Batra S., Cohen S.D., Pruthi M.: The primitive idempotents of a cyclic group algebra. Southeast Asian Bull. Math. 26, 197\u2013208 (2002)."},{"key":"9857_CR3","unstructured":"Arora S.K., Batra S., Cohen S.D., Pruthi M.: The primitive idempotents of a cyclic group algebra II. Southeast Asian Bull. Math. 29, 549\u2013557 (2005)."},{"key":"9857_CR4","unstructured":"Bakshi G.K., Raka M.: Minimal cyclic codes of length $$2^m$$ 2 m . Ranchi Univ. Math. J. 33, 1\u201318 (2003)."},{"key":"9857_CR5","doi-asserted-by":"crossref","unstructured":"Bakshi G.K., Raka M.: Minimal cyclic codes of length $$p^nq$$ p n q . Finite Fields Appl. 9, 432\u2013448 (2003).","DOI":"10.1016\/S1071-5797(03)00023-6"},{"key":"9857_CR6","unstructured":"Batra S., Arora S.K.: Minimal quadratic residue cyclic codes of length $$p^n$$ p n ( $$p$$ p odd). J. Appl. Math. Comput. (Old: KJCAM) 8, 531\u2013547 (2001)."},{"key":"9857_CR7","unstructured":"Batra S., Arora S.K.: Minimal quadratic residue cyclic codes of length $$2^n$$ 2 n . J. Appl. Math. Comput. (Old: KJCAM) 18, 25\u201343 (2005)."},{"key":"9857_CR8","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":"9857_CR9","unstructured":"Betten A., Braun M., Fripertinger H., Kerber A., Kohnert A.A., Wassermann A.: Error Correcting Linear Codes: Classification by Isometry and Applications. Springer, Berlin (2006)."},{"key":"9857_CR10","doi-asserted-by":"crossref","unstructured":"Ferraz R., Polcino C.M.: Idempotents in group algebras and minimal abelian codes. Finite Fields Appl. 13, 382\u2013393 (2007).","DOI":"10.1016\/j.ffa.2005.09.007"},{"key":"9857_CR11","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"9857_CR12","unstructured":"Hughes, G.: Constacyclic codes, cocycles and a $$u+v|u-v$$ u + v | u - v construction. IEEE Trans. Inf. Theory 46(2), 674\u2013680 (2000)."},{"key":"9857_CR13","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (2008)."},{"key":"9857_CR14","doi-asserted-by":"crossref","unstructured":"Lux, K., Pahlings, H.: Representations of Groups: A Computational Approach. Cambridge University Press, Cambridge (2010).","DOI":"10.1017\/CBO9780511750915"},{"key":"9857_CR15","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. NorthHolland, Amsterdam (1977)."},{"key":"9857_CR16","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":"9857_CR17","doi-asserted-by":"crossref","unstructured":"Sahni A., Sehgal P.T.: Minimal cyclic codes of length $$p^nq$$ p n q . Finite Fields Appl. 18, 1017\u20131036 (2012).","DOI":"10.1016\/j.ffa.2012.07.003"},{"key":"9857_CR18","doi-asserted-by":"crossref","unstructured":"Sharma A., Bakshi G.K., Dumir V.C., Raka M.: Cyclotomic numbers and primitive idempotents in the ring $$GF(q)[X]\/\\langle X^{p^n}-1\\rangle $$ G F ( q ) [ X ] \/ \u2329 X p n - 1 \u232a . Finite Fields Appl. 10, 653\u2013673 (2004).","DOI":"10.1016\/j.ffa.2004.01.005"},{"key":"9857_CR19","doi-asserted-by":"crossref","unstructured":"Wan Z.: Lectures on Finite Fields and Galois Rings. World Scientific Publishing, Singapore (2003).","DOI":"10.1142\/5350"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9857-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9857-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9857-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:36Z","timestamp":1559231916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9857-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9857"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9857-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,5]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-013-9857-9', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>