{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:52:26Z","timestamp":1729644746965,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620276","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"499-503","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of dependencies in bounded domains, Armstrong Codes, and generalizations"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"255","article-title":"Group divisible designs","author":"ge","year":"2007","journal-title":"CRC Handbook of Combinatorial Designs"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(98)00029-9"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.3180030308"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.03.004"},{"key":"18","first-page":"124","article-title":"Resolvable and near-resolvable designs","author":"abel","year":"2007","journal-title":"CRC Handbook of Combinatorial Designs"},{"journal-title":"Optimal Armstrong Codes for Branching Dependencies","year":"2013","author":"chee","key":"24"},{"key":"15","first-page":"209","article-title":"On orthogonal double covers of Kn","volume":"37","author":"ganter","year":"1994","journal-title":"Ars Combin"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90006-N"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23441-5_6"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(85)80003-2"},{"key":"11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2478\/s11533-008-0001-4","article-title":"Codes that attain minimum distance in all possible directions","volume":"6","author":"katona","year":"2008","journal-title":"Central European Journal of Mathematics"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77684-0_12"},{"key":"21","first-page":"213","article-title":"Minimal representations of branching dependencies","volume":"60","author":"demetrovics","year":"1995","journal-title":"Acta Sci Math (Szeged)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/509412.509414"},{"key":"20","first-page":"33","article-title":"Suborthogonal double covers of complete graphs","volume":"147","author":"hartmann","year":"2000","journal-title":"Congr Numer"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/320493.320489"},{"key":"1","first-page":"580","article-title":"Dependency structures of data base relationships","author":"armstrong","year":"1974","journal-title":"IFIP Conference Proceedings North-Holland"},{"key":"10","first-page":"529","article-title":"Keys and Armstrong databases in trees with restructuring","volume":"18","author":"sali","year":"2008","journal-title":"Acta Cybernet"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24627-5_9"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90027-8"},{"key":"5","first-page":"247","article-title":"On the equivalence of candidate keys with Sperner systems","volume":"4","author":"demetrovics","year":"1979","journal-title":"Acta Cybernet"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/320576.320580"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90033-7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24627-5_16"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620276.pdf?arnumber=6620276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:45:52Z","timestamp":1498074352000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620276","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}