{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T06:52:18Z","timestamp":1709448738684},"reference-count":6,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p xml:lang=\"fr\">&lt;p style='text-indent:20px;'&gt;We present AI-systems for the binary codes obtained from the adjacency relation of the triangular graphs &lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;\\begin{document}$ T(n) $\\end{document}&lt;\/tex-math&gt;&lt;\/inline-formula&gt; for any &lt;inline-formula&gt;&lt;tex-math id=\"M2\"&gt;\\begin{document}$ n\\ge 5 $\\end{document}&lt;\/tex-math&gt;&lt;\/inline-formula&gt;. These AI-systems are optimal and have for &lt;inline-formula&gt;&lt;tex-math id=\"M3\"&gt;\\begin{document}$ n $\\end{document}&lt;\/tex-math&gt;&lt;\/inline-formula&gt; odd the full error-correcting capability.&lt;\/p&gt;<\/jats:p>","DOI":"10.3934\/amc.2020107","type":"journal-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T08:48:56Z","timestamp":1598258936000},"page":"169","source":"Crossref","is-referenced-by-count":2,"title":["Optimal antiblocking systems of information sets for the binary codes related to triangular graphs"],"prefix":"10.3934","volume":"16","author":[{"given":"Hans-Joachim","family":"Kroll","sequence":"first","affiliation":[]},{"given":"Sayed-Ghahreman","family":"Taherian","sequence":"additional","affiliation":[]},{"given":"Rita","family":"Vincenti","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020107-1","doi-asserted-by":"publisher","unstructured":"J. D. Key, J. Moori, B. G. Rodrigues.Permutation decoding for the binary codes from triangular\ngraphs, <i>European J. Combin.<\/i>, <b>25<\/b> (2004), 113-123.","DOI":"10.1016\/j.ejc.2003.08.001"},{"key":"key-10.3934\/amc.2020107-2","doi-asserted-by":"publisher","unstructured":"H.-J. Kroll, R. Vincenti.Antiblocking decoding, <i>Discrete Appl. Math.<\/i>, <b>158<\/b> (2010), 1461-1464.","DOI":"10.1016\/j.dam.2010.04.007"},{"key":"key-10.3934\/amc.2020107-3","doi-asserted-by":"publisher","unstructured":"H.-J. Kroll, R. Vincenti.How to find small AI-systems for antiblocking decoding, <i>Discrete Math.<\/i>, <b>312<\/b> (2012), 657-665.","DOI":"10.1016\/j.disc.2011.06.014"},{"key":"key-10.3934\/amc.2020107-4","unstructured":"V. Pless and W. C. Huffman, <i>Handbook of Coding Theory<\/i>, Elsevier, Amsterdam, 1998."},{"key":"key-10.3934\/amc.2020107-5","doi-asserted-by":"publisher","unstructured":"J. Sch\u00f6nheim.On Coverings, <i>Pacific J. Math.<\/i>, <b>14<\/b> (1964), 1405-1411.","DOI":"10.2140\/pjm.1964.14.1405"},{"key":"key-10.3934\/amc.2020107-6","unstructured":"V. D. Tonchev, <i>Combinatorial Configurations Designs, Codes, Graphs<\/i>, Pitman Monographs and Surveys in Pure and Applied Mathematics, Vol. 40, Longman, New York, 1988."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=49aa3ba1-7560-484f-af21-ec6514988ae8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T11:43:46Z","timestamp":1640864626000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_1_169"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020107","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}