{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T14:40:15Z","timestamp":1681828815331},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0012-365x(85)90022-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"141-146","source":"Crossref","is-referenced-by-count":0,"title":["On some connections between permutations and coding"],"prefix":"10.1016","volume":"56","author":[{"given":"J.","family":"D\u00e9nes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(85)90022-6_BIB1","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0019-9958(79)90076-7","article-title":"Coding with permutations","volume":"43","author":"Blake","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(85)90022-6_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/TIT.1983.1056614","article-title":"Graph theoretic approaches to the code construction for two-user multiple access binary adder channel","volume":"29","author":"Kasami","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(85)90022-6_BIB3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Non-random binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(85)90022-6_BIB4","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1145\/322326.322329","article-title":"Parallel permutation and sorting algorithms and a new generalized connection network","volume":"29","author":"Nassimi","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(85)90022-6_BIB5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/TIT.1976.1055496","article-title":"On coding precedence relations with a pair-ordering fidelity criterion","volume":"22","author":"Pearl","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(85)90022-6_BIB6","series-title":"(On (m, n)-mutants in symmetric semigroups","first-page":"1","author":"Szentes","year":"1976"},{"key":"10.1016\/0012-365X(85)90022-6_BIB8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TIT.1973.1054954","article-title":"A class of codes for asymmetric channels and a problem from the additive theory of numbers","volume":"19","author":"Varshamov","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(85)90022-6_BIB9","article-title":"Combinatorics: Room squares, sum-free sets, Hadamard matrices","volume":"292","author":"Wallis","year":"1972"},{"key":"10.1016\/0012-365X(85)90022-6_BIB10","first-page":"1","article-title":"Permutations, partitions, permanents, parallelism","author":"Lehmer","year":"1978","journal-title":"Math. Appl. 1er Colloq. AFCET-SMF Palaiseau 1978"},{"key":"10.1016\/0012-365X(85)90022-6_BIB12","first-page":"24","article-title":"On Hamming distance between Boolean matrices","volume":"3","author":"Kim","year":"1978","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/0012-365X(85)90022-6_BIB13","series-title":"Theory of Graphs","first-page":"65","article-title":"Transformation, transformation semigroups","author":"D\u00e9nes","year":"1968"},{"key":"10.1016\/0012-365X(85)90022-6_BIB14","doi-asserted-by":"crossref","first-page":"283","DOI":"10.5486\/PMD.1968.15.1-4.31","article-title":"On some properties of commutator semigroups","volume":"15","author":"D\u00e9nes","year":"1968","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/0012-365X(85)90022-6_BIB15","series-title":"Permutations","first-page":"117","article-title":"On a generalization of permutations","author":"D\u00e9nes","year":"1972"},{"key":"10.1016\/0012-365X(85)90022-6_BIB16","series-title":"Proc. Conference on Semigroups in honour of A.H. Clifford","first-page":"222","article-title":"The commutator subsemigroup of semigroup of binary relations","author":"D\u00e9nes","year":"1979"},{"key":"10.1016\/0012-365X(85)90022-6_BIB17","first-page":"18","article-title":"A Moore-Penrose inverse for Boolean relation matrices","volume":"403","author":"Kim","year":"1974"},{"key":"10.1016\/0012-365X(85)90022-6_BIB18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02195735","article-title":"\u00dcber einige Eigenschaften der Kommutatoren der Symmetrischen Halbgruppe","volume":"15","author":"Todorov","year":"1977","journal-title":"Semigroup Forum"},{"key":"10.1016\/0012-365X(85)90022-6_BIB19","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TIT.1984.1056932","article-title":"Critical analysis of the security of knapsack public key algorithms","author":"Desmedt","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(85)90022-6_BIB21","first-page":"165","article-title":"\u00d6sszead\u00f3 aritmetikai egys\u00e9g marad\u00e9ksz\u00e1mrendszerben","volume":"15","author":"D\u00e9nes","year":"1967","journal-title":"M\u00e9r\u00e9s \u00e9s Automatika"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T14:25:07Z","timestamp":1681827907000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X85900226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0012365X85900226"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(85)90022-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}