{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:18:51Z","timestamp":1757312331071,"version":"3.38.0"},"reference-count":28,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.3934\/amc.2024040","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T11:52:07Z","timestamp":1727697127000},"page":"1041-1056","source":"Crossref","is-referenced-by-count":1,"title":["LCD codes constructed from weakly &lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;$ p $&lt;\/tex-math&gt;&lt;\/inline-formula&gt;-self-orthogonal 1-designs"],"prefix":"10.3934","volume":"19","author":[{"given":"Vedrana Mikuli\u0107","family":"Crnkovi\u0107","sequence":"first","affiliation":[]},{"given":"Ivona","family":"Traunkar","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, University of Rijeka, Radmile Matej\u010di\u0107 2, 51000 Rijeka, Croatia"}]},{"given":"Bernardo G.","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Applied Mathematics, University of Pretoria, Private Bag X20, Hatfield, Pretoria 0028, South Africa"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2024040-1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836"},{"key":"key-10.3934\/amc.2024040-2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00130567"},{"key":"key-10.3934\/amc.2024040-3","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(00)00281-0"},{"key":"key-10.3934\/amc.2024040-4","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"key-10.3934\/amc.2024040-5","doi-asserted-by":"crossref","unstructured":"<p>S. Bouyuklieva, Optimal binary LCD codes, <i>Des. Codes Cryptogr.<\/i>, <b>89<\/b> 2021, 2445\u20132461.<\/p>","DOI":"10.1007\/s10623-021-00929-w"},{"key":"key-10.3934\/amc.2024040-6","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016.10.131"},{"key":"key-10.3934\/amc.2024040-7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2789347"},{"key":"key-10.3934\/amc.2024040-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2006.06.001"},{"key":"key-10.3934\/amc.2024040-9","unstructured":"<p>C. J. Colbourn and J. H. Dinitz, <i>Handbook of Combinatorial Designs<\/i>, Second Edition (Discrete Mathematics and Its Applications), Chapman and Hall\/CRC (2006).<\/p>"},{"key":"key-10.3934\/amc.2024040-10"},{"key":"key-10.3934\/amc.2024040-11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-3634-3"},{"key":"key-10.3934\/amc.2024040-12"},{"key":"key-10.3934\/amc.2024040-13","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-019-00409-8"},{"key":"key-10.3934\/amc.2024040-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2018.09.002"},{"key":"key-10.3934\/amc.2024040-15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018036"},{"key":"key-10.3934\/amc.2024040-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2012.05.006"},{"key":"key-10.3934\/amc.2024040-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2018.08.019"},{"key":"key-10.3934\/amc.2024040-18","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2013.7.161"},{"key":"key-10.3934\/amc.2024040-19","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0038-x"},{"key":"key-10.3934\/amc.2024040-20","doi-asserted-by":"crossref","unstructured":"<p>S. T. Dougherty, J.-L. Kim, B. Ozkaya, L. Sok and P. Sol\u00e9, The combinatorics of LCD codes: Linear programming bound and orthogonal matrices, <i>Int. J. Inf. Coding Theory.<\/i>, <b>4<\/b> (2017) 116-128.<\/p>","DOI":"10.1504\/IJICOT.2017.083827"},{"key":"key-10.3934\/amc.2024040-21","unstructured":"<p>M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, Online available at <ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"http:\/\/www.codetables.de\">http:\/\/www.codetables.de<\/ext-link>.<\/p>"},{"key":"key-10.3934\/amc.2024040-22","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00553-8"},{"key":"key-10.3934\/amc.2024040-23","unstructured":"<p>V. Kr\u010dadinac, Quasi-symmetric designs, <ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/web.math.pmf.unizg.hr\/krcko\/results\/quasisym.html\">https:\/\/web.math.pmf.unizg.hr\/krcko\/results\/quasisym.html<\/ext-link>.<\/p>"},{"key":"key-10.3934\/amc.2024040-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.05.030"},{"key":"key-10.3934\/amc.2024040-25","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90563-U"},{"key":"key-10.3934\/amc.2024040-26","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-020-00484-2"},{"key":"key-10.3934\/amc.2024040-27","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90030-7"},{"key":"key-10.3934\/amc.2024040-28"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T08:24:31Z","timestamp":1742199871000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2024040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2024040","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"type":"print","value":"1930-5346"},{"type":"electronic","value":"1930-5338"}],"subject":[],"published":{"date-parts":[[2025]]}}}