{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:44:00Z","timestamp":1720640640448},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0653(04)00408-1","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"268-271","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A Cryptographic Code Based on Digraphs"],"prefix":"10.1016","volume":"10","author":[{"given":"S.","family":"Strauss","sequence":"first","affiliation":[]},{"given":"L.","family":"Markenzon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00408-1_BIB1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(98)00073-8","article-title":"A Homophonic DES, Inf.","volume":"66","author":"Hsieh","year":"1998","journal-title":"Proc. Lett."},{"key":"10.1016\/S1571-0653(04)00408-1_BIB2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0210028","article-title":"Recursive Graphs, Recursive Labelings and Shortest Paths","volume":"10","author":"Proskurowski","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1571-0653(04)00408-1_BIB3","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1109\/18.782143","article-title":"Efficient Homophonic Coding","volume":"45","author":"Ryabko","year":"1999","journal-title":"IEEE Trans, on Inf. Theory"},{"key":"10.1016\/S1571-0653(04)00408-1_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","article-title":"On Simple Characterizations of fc-Trees","volume":"7","author":"Rose","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(04)00408-1_BIB5","series-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"Schenier","year":"1996"},{"key":"10.1016\/S1571-0653(04)00408-1_BIB6","volume":"58","author":"Tsfasman","year":"1991"},{"key":"10.1016\/S1571-0653(04)00408-1_BIB7","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The Recognition of Series Parallel Digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:54:47Z","timestamp":1548597287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":7,"alternative-id":["S1571065304004081"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00408-1","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}