{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:40Z","timestamp":1740131680731,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001381","name":"Singapore National Research Foundation","doi-asserted-by":"crossref","award":["NRF-CRP2-2007-03"],"award-info":[{"award-number":["NRF-CRP2-2007-03"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/tit.2014.2377735","type":"journal-article","created":{"date-parts":[[2014,12,6]],"date-time":"2014-12-06T00:23:19Z","timestamp":1417825399000},"page":"812-819","source":"Crossref","is-referenced-by-count":3,"title":["Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations"],"prefix":"10.1109","volume":"61","author":[{"family":"Yeow Meng Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hui Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xiande Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/S0166-218X(85)80003-2"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/0166-218X(92)90027-8"},{"key":"ref12","first-page":"213","article-title":"Minimal representations of branching dependencies","volume":"60","author":"demetrovics","year":"1995","journal-title":"Acta Sci Math"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/S0378-3758(98)00029-9"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/0012-365X(91)90006-N"},{"key":"ref15","first-page":"209","article-title":"On orthogonal double covers of ${K}_{n}$","volume":"37","author":"ganter","year":"1994","journal-title":"Ars Combin"},{"key":"ref16","first-page":"255","article-title":"Group divisible designs","author":"ge","year":"2007","journal-title":"The CRC Handbook of Combinatorial Designs"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1002\/jcd.3180030308"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/978-3-540-24627-5_9"},{"key":"ref19","first-page":"33","article-title":"Suborthogonal double covers of complete graphs","volume":"147","author":"hartmann","year":"2000","journal-title":"Congr Numer"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/509412.509414"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1016\/0166-218X(92)90033-7"},{"key":"ref3","first-page":"580","article-title":"Dependency structures of data base relationships","author":"armstrong","year":"1974","journal-title":"Proc IFIP Congr"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/s10623-012-9711-5"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/320493.320489"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ISIT.2013.6620276"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/18.651001"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1002\/9780470277331"},{"key":"ref9","first-page":"247","article-title":"On the equivalence of candidate keys with Sperner systems","volume":"4","author":"demetrovics","year":"1979","journal-title":"Acta Cybern"},{"key":"ref1","first-page":"124","article-title":"Resolvable and near-resolvable designs","author":"abel","year":"2007","journal-title":"The CRC Handbook of Combinatorial Designs"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.dam.2004.03.004"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/320576.320580"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.2478\/s11533-008-0001-4"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/978-3-642-23441-5_6"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/978-3-540-24627-5_16"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/978-3-540-77684-0_12"},{"key":"ref25","first-page":"529","article-title":"Keys and Armstrong databases in trees with restructuring","volume":"18","author":"sali","year":"2008","journal-title":"Acta Cybern"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7012129\/06977949.pdf?arnumber=6977949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:43Z","timestamp":1642004863000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6977949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":27,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2377735","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}