{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T15:32:23Z","timestamp":1772897543566,"version":"3.50.1"},"reference-count":29,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T00:00:00Z","timestamp":1565654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["6732"],"award-info":[{"award-number":["6732"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>A generalization of Ding\u2019s construction is proposed that employs as a defining set the collection of the sth powers (    s \u2265 2    ) of all nonzero elements in     G F (  p m  )    , where     p \u2265 2     is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over     G F ( 4 )     that give rise to optimal or near optimal quantum codes. In addition, the codes yield interesting combinatorial structures, such as strongly regular graphs and block designs.<\/jats:p>","DOI":"10.3390\/a12080168","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T03:59:26Z","timestamp":1565755166000},"page":"168","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cyclotomic Trace Codes"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3299-7859","authenticated-orcid":false,"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Rijeka, Radmile Matej\u010di\u0107 2, 51000 Rijeka, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6558-5167","authenticated-orcid":false,"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Rijeka, Radmile Matej\u010di\u0107 2, 51000 Rijeka, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1806-3571","authenticated-orcid":false,"given":"Vladimir D.","family":"Tonchev","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Michigan Technological University, Houghton, MI 49931, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2288","DOI":"10.1016\/j.disc.2016.03.029","article-title":"A construction of binary linear codes from Boolean functions","volume":"339","author":"Ding","year":"2016","journal-title":"Discret. Math."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1109\/TIT.2007.896886","article-title":"Cyclotomic linear codes of order 3","volume":"53","author":"Ding","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Ding, C., Luo, J., and Niederreiter, H. (2007, January 11\u201315). Two weight codes punctured from irreducible cyclic codes. Proceedings of the First International Workshop on Coding Theory and Cryptography, Wuyi Mountain, China.","DOI":"10.1142\/9789812832245_0009"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00200-017-0345-8","article-title":"Few-weight codes from trace codes over a local ring","volume":"29","author":"Shi","year":"2018","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00200-018-0359-x","article-title":"Several classes of linear codes and their weight distributions","volume":"30","author":"Wang","year":"2019","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2513","DOI":"10.1007\/s10623-017-0454-1","article-title":"Three-weight ternary linear codes from a family of cyclic difference sets","volume":"86","author":"Zhou","year":"2018","journal-title":"Des. Codes Cryptogr."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","article-title":"Linear Codes from Some 2-Designs","volume":"61","author":"Ding","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/s10623-017-0363-3","article-title":"A link between combinatorial designs and three-weight linear codes","volume":"86","author":"Olmez","year":"2018","journal-title":"Des. Codes Cryptogr."},{"key":"ref_9","first-page":"181","article-title":"Every equidistant code is a sequence of dual Hamming codes","volume":"18","author":"Bonisoli","year":"1983","journal-title":"Ars Combinatoria"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.ffa.2017.12.010","article-title":"The classification of antipodal two-weight linear codes","volume":"50","author":"Jungnickel","year":"2018","journal-title":"Finite Fields Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s10623-017-0406-9","article-title":"On Bonisoli\u2019s theorem and the block codes of Steiner triple systems","volume":"86","author":"Jungnickel","year":"2018","journal-title":"Des. Codes Cryptogr."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ding, C., Munemasa, A., and Tonchev, V.D. (2019). Bent Vectorial Functions, Codes and Designs. IEEE Trans. Inf. Theory.","DOI":"10.1109\/TIT.2019.2922401"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(85)90062-9","article-title":"Some new two-weight codes and strongly regular graphs","volume":"10","author":"Brouwer","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"ref_14","first-page":"159","article-title":"Self-orthogonal doubly-even codes from Hadamard matrices of order 48","volume":"1","year":"2008","journal-title":"Adv. Appl. Discret. Math."},{"key":"ref_15","unstructured":"Bosma, W., and Cannon, J. (1994). Handbook of Magma Functions, Department of Mathematics, University of Sydney."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., and Pless, V. (2003). Fundamentals of Error-Correcting Codes, Cambridge University Press.","DOI":"10.1017\/CBO9780511807077"},{"key":"ref_17","unstructured":"Grassl, M. (2019, August 11). Bounds on the Minimum Distance of Linear Codes and Quantum Codes. Available online: http:\/\/www.codetables.de."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., and Dinitz, J.H. (2007). Strongly Regular Graphs. Handbook of Combinatorial Designs, Chapman & Hall\/CRC. [2nd ed.].","DOI":"10.1201\/9781420010541"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Shrikhande, M.S., and Sane, S.S. (1991). Quasi-Symmetric Designs, Cambridge University Press.","DOI":"10.1017\/CBO9780511665615"},{"key":"ref_20","unstructured":"Tonchev, V.D. (1988). Combinatorial Configurations: Designs, Codes, Graphs, John Willey & Sons."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., Cohen, A.M., and Neumaier, A. (1989). Distance-Regular Graphs, Springer.","DOI":"10.1007\/978-3-642-74341-2"},{"key":"ref_22","unstructured":"Brouwer, A.E. (2019, May 24). Parameters of Strongly Regular Graphs. Available online: http:\/\/www.win.tue.nl\/$\\sim$aeb\/graphs\/srg\/srgtab.html."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1112\/blms\/18.2.97","article-title":"The geometry of two-weight codes","volume":"118","author":"Calderbank","year":"1986","journal-title":"Bull. Lond. Math. Soc."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0012-365X(92)90532-K","article-title":"Structure and uniqueness of the (81,20,1,6) strongly regular graph","volume":"106\/107","author":"Brouwer","year":"1992","journal-title":"Discret. Math."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.681315","article-title":"Quantum error correction via codes over GF(4)","volume":"44","author":"Calderbank","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"R2493","DOI":"10.1103\/PhysRevA.52.R2493","article-title":"Scheme for reducing decoherence in quantum computer memory","volume":"52","author":"Shor","year":"1995","journal-title":"Phys. Rev. A"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"6368","DOI":"10.1016\/j.disc.2007.12.007","article-title":"Quantum codes from caps","volume":"308","author":"Tonchev","year":"2008","journal-title":"Discret. Math."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., and Dinitz, J.H. (2007). Symmetric Designs. Handbook of Combinatorial Designs, Chapman & Hall\/CRC. [2nd ed.].","DOI":"10.1201\/9781420010541"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., and Dinitz, J.H. (2007). Quasi-Symmetric Designs. Handbook of Combinatorial Designs, Chapman & Hall\/CRC. [2nd ed.].","DOI":"10.1201\/9781420010541"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/8\/168\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:10:49Z","timestamp":1760188249000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/8\/168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,13]]},"references-count":29,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2019,8]]}},"alternative-id":["a12080168"],"URL":"https:\/\/doi.org\/10.3390\/a12080168","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,13]]}}}