{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:41:24Z","timestamp":1772808084367,"version":"3.50.1"},"reference-count":17,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2017]]},"DOI":"10.3934\/amc.2017003","type":"journal-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T09:28:42Z","timestamp":1487237322000},"page":"77-82","source":"Crossref","is-referenced-by-count":6,"title":["Some designs and codes invariant under the Tits group"],"prefix":"10.3934","volume":"11","author":[{"given":"Jamshid","family":"Moori","sequence":"first","affiliation":[]},{"given":"Amin","family":"Saeidi","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2017003-1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836"},{"key":"key-10.3934\/amc.2017003-2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"key-10.3934\/amc.2017003-3","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(82)90073-4"},{"key":"key-10.3934\/amc.2017003-4"},{"key":"key-10.3934\/amc.2017003-5","unstructured":"<p>The GAP Group, <i>GAP -Groups, Algorithms, and Programming, Version 4.7.6<\/i>, 2014, available at <a href=\"http:\/\/www.gap-system.org\" target=\"_blank\">http:\/\/www.gap-system.org<\/a><\/p>"},{"key":"key-10.3934\/amc.2017003-6","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(93)90045-A"},{"key":"key-10.3934\/amc.2017003-7","unstructured":"<p>W. C. Huffman, Codes and groups, in <i>Handbook of Coding Theory<\/i>, Elsevier, 1998,1345-1440.<\/p>"},{"key":"key-10.3934\/amc.2017003-8","unstructured":"<p>C. Jansen, K. Lux, R. Parker and R Wilson, <i>An Atlas of Brauer Characters<\/i>, Oxford Sci. Publ. , Oxford, 1995.<\/p>"},{"key":"key-10.3934\/amc.2017003-9"},{"key":"key-10.3934\/amc.2017003-10"},{"key":"key-10.3934\/amc.2017003-11","doi-asserted-by":"crossref","unstructured":"<p>J. Moori, Finite groups, designs and codes, Information security, coding theory and related combinatorics, NATO Sci. Peace Secur. Ser. D Inf. Commun. Secur., 29, IOS, Amsterdam, 2011, 202-230,<\/p>","DOI":"10.3233\/978-1-60750-663-8-202"},{"key":"key-10.3934\/amc.2017003-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2004.10.001"},{"key":"key-10.3934\/amc.2017003-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2007.02.004"},{"key":"key-10.3934\/amc.2017003-14"},{"key":"key-10.3934\/amc.2017003-15"},{"key":"key-10.3934\/amc.2017003-16","unstructured":"<p>B. G. Rodrigues, <i>Codes of Designs and Graphs from Finite Simple Groups<\/i>, Ph. D thesis, Univ. Natal, 2002.<\/p>"},{"key":"key-10.3934\/amc.2017003-17","doi-asserted-by":"publisher","DOI":"10.2307\/1970394"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2017_1_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:04:23Z","timestamp":1772791463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2017003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2017003","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}