{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:25:38Z","timestamp":1648700738354},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>Superimposed codes is a special combinatorial structure that has many applications in information theory, data communication and cryptography. On the other hand, mutually orthogonal latin squares is a beautiful combinatorial object that has deep connection with design theory. In this paper, we draw a connection between these two structures. We give explicit construction of mutually orthogonal latin squares and we show a method of generating new larger superimposed codes from an existing one by using mutually orthogonal latin squares. If n denotes the number of codewords in the existing code then the new code contains n<jats:sup>2<\/jats:sup>codewords. Recursively, using this method, we can construct a very large superimposed code from a small simple code. Well-known constructions of superimposed codes are based on algebraic Reed\u2013Solomon codes and our new construction gives a combinatorial alternative approach.<\/jats:p>","DOI":"10.1142\/s179383091250022x","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T08:31:23Z","timestamp":1344241883000},"page":"1250022","source":"Crossref","is-referenced-by-count":0,"title":["SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES"],"prefix":"10.1142","volume":"04","author":[{"given":"JENNIFER","family":"SEBERRY","sequence":"first","affiliation":[{"name":"School of Computer Science and Software Engineering, University of Wollongong, Australia"}]},{"given":"DONGVU","family":"TONIEN","sequence":"additional","affiliation":[{"name":"Mathematical Sciences Institute, Australian National University, Australia"}]}],"member":"219","published-online":{"date-parts":[[2012,8,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00281-0"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(84)90058-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/18.817530"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6048-4_22"},{"key":"rf7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00191355","volume":"8","author":"Dyer M.","journal-title":"J. Cryptol."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90068-6"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900054"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.07.001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091250022X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T09:27:33Z","timestamp":1594546053000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091250022X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,6]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,8,6]]},"published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1142\/S179383091250022X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091250022x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,6]]}}}