{ "labelLang" : "hun", "responseDate" : "2024-03-29 02:52", "content" : { "otype" : "JournalArticle", "mtid" : 22832300, "status" : "ADMIN_APPROVED", "published" : true, "comment" : "Cited By :12 \n Export Date: 25 October 2022 \n CODEN: IETTA \n Correspondence Address: Fujiwara, Y.; Department of Mathematical Sciences, , Houghton, MI 49931, United States; email: yfujiwar@mtu.edu \n Funding details: U.S. Department of Defense, DOD, N00014-08-1-1069, N00014-08-1-1070 \n Funding details: Japan Society for the Promotion of Science, KAKEN \n Funding text 1: Manuscript received October 04, 2008; revised January 04, 2010. Current version published June 16, 2010. This work was supported in part by JSPS Research Fellowships for Young Scientists (YF) and by DOD Grants N00014-08-1-1069 and N00014-08-1-1070 (CJC). Y. Fujiwara is with the Department of Mathematical Sciences, Michigan Technological University, Houghton, MI 49931 USA (e-mail: yfu-jiwar@mtu.edu). C. J. Colbourn is with the School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ 85287 USA (e-mail: charles.colbourn@asu.edu). Communicated by G. Seroussi, Associate Editor for Coding Theory. Digital Object Identifier 10.1109/TIT.2010.2048468", "unhandledTickets" : 0, "oldTimestamp" : "2018-10-01T21:41:19.000+0000", "deleted" : false, "oldId" : 12832300, "lastRefresh" : "2024-01-16T12:05:20.629+0000", "lastModified" : "2023-04-19T14:56:56.921+0000", "created" : "2013-01-15T15:52:10.000+0000", "creator" : { "otype" : "Admin", "mtid" : 10015168, "link" : "/api/admin/10015168", "label" : "Szakonyi Erzsebet (RAMKI admin 4)", "familyName" : "Szakonyi", "givenName" : "Erzsebet", "published" : true, "oldId" : 10015168, "snippet" : true }, "lastDuplumSearch" : "2024-01-16T12:01:28.095+0000", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Fujiwara, Y", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 21592968, "link" : "/api/authorship/21592968", "label" : "Fujiwara, Y", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Fujiwara", "givenName" : "Y", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 31049079, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 21592969, "link" : "/api/authorship/21592969", "label" : "Colbourn, CJ", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Colbourn", "givenName" : "CJ", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 31049078, "snippet" : true } ], "title" : "A combinatorial approach to X-tolerant compaction circuits", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 5700991, "link" : "/api/publicationidentifier/5700991", "label" : "DOI: 10.1109/TIT.2010.2048468", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "10.1109/TIT.2010.2048468", "realUrl" : "https://doi.org/10.1109/TIT.2010.2048468", "published" : false, "oldId" : 2844185, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 5700989, "link" : "/api/publicationidentifier/5700989", "label" : "WoS: 000278812000013", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "000278812000013", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000278812000013", "published" : false, "oldId" : 9362293, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 5700990, "link" : "/api/publicationidentifier/5700990", "label" : "Scopus: 77953781325", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "77953781325", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77953781325", "published" : false, "oldId" : 2844186, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15056993, "link" : "/api/publicationidentifier/15056993", "label" : "Google scholar: 7435330660361625859", "source" : { "otype" : "PlainSource", "mtid" : 12, "link" : "/api/publicationsource/12", "label" : "Google scholar", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Google scholar", "linkPattern" : "http://scholar.Google.com/scholar?hl=en&lr=&cluster=@@@", "publiclyVisible" : true, "published" : true, "oldId" : 12, "snippet" : true }, "validState" : "NO", "idValue" : "7435330660361625859", "realUrl" : "http://scholar.Google.com/scholar?hl=en&lr=&cluster=7435330660361625859", "published" : false, "oldId" : 4875285, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 2050472, "link" : "/api/journal/2050472", "label" : "IEEE TRANSACTIONS ON INFORMATION THEORY 0018-9448 1557-9654", "pIssn" : "0018-9448", "eIssn" : "1557-9654", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 2050472, "snippet" : true }, "volume" : "56", "issue" : "7", "firstPage" : "3196", "lastPage" : "3206", "internalId" : "5485008", "firstPageOrInternalIdForSort" : "3196, 5485008", "pageLength" : 11, "publishedYear" : 2010, "digital" : null, "printed" : null, "sourceYear" : 2013, "packet" : "630314", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : null, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2024-01-16", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 4, "citedCount" : 4, "references" : [ { "otype" : "Reference", "mtid" : 15676990, "link" : "/api/reference/15676990", "label" : "1. McCluskey, E.J., Burek, D., Koenemann, B., Mitra, S., Patel, J.H., Rajski, J., Waicukauski, J.A., Test compression roundtable (2003) IEEE Des. Test. Comput., 20, pp. 76-87. , Mar./Apr", "listPosition" : 1, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676991, "link" : "/api/reference/15676991", "label" : "2. Lempel, A., Cohn, M., Design of universal test sequences for VLSI (1985) IEEE Trans. Inf. Theory, 31, pp. 10-17. , Jan", "listPosition" : 2, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676992, "link" : "/api/reference/15676992", "label" : "3. Seroussi, G., Bshouty, N.H., Vector sets for exhaustive testing of logic circuits (1988) IEEE Trans. Inf. Theory, 34, pp. 513-522. , May", "listPosition" : 3, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676993, "link" : "/api/reference/15676993", "label" : "4. Hollmann, H., Design of test sequences for VLSI self-testing using LFSR (1990) IEEE Trans. Inf. Theory, 36, pp. 386-392. , Mar", "listPosition" : 4, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676994, "link" : "/api/reference/15676994", "label" : "5. Cohen, G.D., Zemor, G., Intersecting codes and independent families (1994) IEEE Trans. Inf. Theory, 40, pp. 1872-1881. , Nov", "listPosition" : 5, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676995, "link" : "/api/reference/15676995", "label" : "6. Benowitz, N., Calhoun, D.F., Alderson, G.E., Bauer, J.E., Joeckel, C.T., An advanced fault isolation system for digital logic (1975) IEEE Trans. Comput., C-24, pp. 489-497. , May", "listPosition" : 6, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676996, "link" : "/api/reference/15676996", "label" : "7. McCluskey, E.J., (1986) Logic Design Principles with Emphasis on Testable Semi-Custom Circuits, , Upper Saddle River NJ: Prentice-Hall", "listPosition" : 7, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676997, "link" : "/api/reference/15676997", "label" : "8. Saxena, N.R., McCluskey, E.J., Parallel signature analysis design with bounds on aliasing (1997) IEEE Trans. Comput., 46, pp. 425-438. , Apr", "listPosition" : 8, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676998, "link" : "/api/reference/15676998", "label" : "9. Barnhart, C., Brunkhorst, V., Distler, F., Farnsworth, O., Keller, B., Koenemann, B., OPMISR: The foundation for compressed ATPG vectors (2001) Proc. Int. Test Conf., pp. 748-757", "listPosition" : 9, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15676999, "link" : "/api/reference/15676999", "label" : "10. Barnhart, C., Brunkhorst, V., Distler, F., Farnsworth, O., Ferko, A., Keller, B., Scott, D., Onodera, T., Extending OPMISR beyond 10 × scan test efficiency (2002) IEEE Design Test Comput., 19, pp. 65-73. , Sep", "listPosition" : 10, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677000, "link" : "/api/reference/15677000", "label" : "11. Mitra, S., Lumetta, S.S., Mitzenmacher, M., Patil, N., X-tolerant test response compaction (2005) IEEE Des. Test. Comput., 22, pp. 566-574. , Nov", "listPosition" : 11, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677001, "link" : "/api/reference/15677001", "label" : "12. Mitra, S., Kim, K.S., X-compact: An efficient response compaction technique (2004) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., 23, pp. 421-432. , Mar", "listPosition" : 12, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677002, "link" : "/api/reference/15677002", "label" : "13. Lumetta, S.S., Mitra, S., (2003) X-Codes: Theory and Applications of Unknowable Inputs Center for Reliable and High-Performance Computing, , Univ. Illinois at Urbana Champaign, Tech. Rep. CRHC-03-08 (also UILU-ENG-03-2217)", "listPosition" : 13, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677003, "link" : "/api/reference/15677003", "label" : "14. Lumetta, S.S., Mitra, S., X-codes: Error control with unknowable inputs (2003) Proc. IEEE Int. Symp. Inf. Theory, p. 102. , Yokohama, Japan Jun", "listPosition" : 14, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677004, "link" : "/api/reference/15677004", "label" : "15. Wohl, P., Huisman, L., Analysis and design of optimal combinational compactors (2003) Proc. 21st IEEE VLSI Test Symp., pp. 101-106. , Apr./May", "listPosition" : 15, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677005, "link" : "/api/reference/15677005", "label" : "16. Patel, J.H., Lumetta, S.S., Reddy, S.M., Application of Saluja-Karpovsky compactors to test responses with many unknowns (2003) Proc. 21st IEEE VLSI Test Symp., pp. 107-112", "listPosition" : 16, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677006, "link" : "/api/reference/15677006", "label" : "17. Rao, T.R.N., Fujiwara, E., (1989) Error-Control Coding for Computer Systems, , Englewood Cliffs NJ: Prentice-Hall", "listPosition" : 17, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677007, "link" : "/api/reference/15677007", "label" : "18. Saluja, K.K., Karpovsky, M., Testing computer hardware through data compression in space and time (1983) Proc. Int. Test Conf., pp. 83-93", "listPosition" : 18, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677008, "link" : "/api/reference/15677008", "label" : "19. Kautz, W.H., Singleton, R.R., Nonrandom binary superimposed codes (1964) IEEE Trans. Inf. Theory, 10, pp. 363-377. , Jul", "listPosition" : 19, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677009, "link" : "/api/reference/15677009", "label" : "20. Sperner, E., Ein satzüber Untermengen einer endlichen Menge (1928) Math. Z., 27, pp. 544-548", "listPosition" : 20, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677010, "link" : "/api/reference/15677010", "label" : "21. Stinson, D.R., Wei, R., Some new upper bounds for cover-free families (2000) J. Combin. Theory Ser. A, 90, pp. 224-234", "listPosition" : 21, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677011, "link" : "/api/reference/15677011", "label" : "22. D'Yachkov, A.G., Rykov, V.V., Bounds on the length of disjunctive codes (1982) Probl. Contr. Inf. Theory, 11, pp. 7-33. , (in Russian)", "listPosition" : 22, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677012, "link" : "/api/reference/15677012", "label" : "23. Füredi, Z., On r-cover-free families (1996) J. Combin. Theory, Ser. A, 73, pp. 172-173", "listPosition" : 23, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677013, "link" : "/api/reference/15677013", "label" : "24. Ruszinkó, M., On the upper bound of the size of the r-cover-free families (1994) J. Combin. Theory, Ser. A, 66, pp. 302-310", "listPosition" : 24, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677014, "link" : "/api/reference/15677014", "label" : "25. D'Yachkov, A.G., Rykov, V.V., Rashad, A.M., Superimposed distance codes (1989) Probl. Contr. Infm. Theory, 18, pp. 237-250", "listPosition" : 25, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677015, "link" : "/api/reference/15677015", "label" : "26. Du, D.Z., Hwang, F.K., (2000) Combinatorial Group Testing and Its Applications, , 2nd ed. Singapore: World Scientific", "listPosition" : 26, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677016, "link" : "/api/reference/15677016", "label" : "27. Fu, H.L., Hwang, F.K., A novel use of t-packings to construct -disjunct matrices (2006) Discrete Appl. Math., 154, pp. 1759-1762", "listPosition" : 27, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677017, "link" : "/api/reference/15677017", "label" : "28. D'Yachkov, A.G., MacUla, A.J., Rykov, V.V., New constructions of superimposed codes (2000) IEEE Trans. Inf. Theory, 46, pp. 284-290. , Jan", "listPosition" : 28, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677018, "link" : "/api/reference/15677018", "label" : "29. MacUla, A.J., A simple construction of -disjunct matrices with certain constant weights (1996) Discrete Math., 162, pp. 311-312", "listPosition" : 29, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677019, "link" : "/api/reference/15677019", "label" : "30. MacUla, A.J., Error-correcting nonadaptive group testing with -disjunct matrices (1997) Discrete Appl. Math., 80, pp. 217-222", "listPosition" : 30, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677020, "link" : "/api/reference/15677020", "label" : "31. Yeh, H.G., Disjunct matrices: Bounds and Lovász Local Lemma (2002) Discrete Math., 253, pp. 97-107", "listPosition" : 31, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677021, "link" : "/api/reference/15677021", "label" : "32. De Bonis, A., Vaccaro, U., Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels (2003) Theor. Comput. Sci., 306, pp. 223-243", "listPosition" : 32, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677022, "link" : "/api/reference/15677022", "label" : "33. Colbourn, C.J., Rosa, A., (1999) Triple Systems, , Oxford U.K. Oxford Univ. Press", "listPosition" : 33, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677023, "link" : "/api/reference/15677023", "label" : "34. Erdos, P., Frankl, P., Füredi, Z., Families of finite sets in which no set is covered by the union of two others (1982) J. Combin. Theory, Ser. A, 33, pp. 158-166", "listPosition" : 34, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677024, "link" : "/api/reference/15677024", "label" : "35. Colbourn, C.J., Fujiwara, Y., Small stopping sets in Steiner triple systems (2009) Cryptogr. Commun., 1 (1), pp. 31-46", "listPosition" : 35, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677025, "link" : "/api/reference/15677025", "label" : "36. Grannell, M.J., Griggs, T.S., Whitehead, C.A., The resolution of the anti-Pasch conjecture (2000) J. Combin. Des., 8, pp. 300-309", "listPosition" : 36, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677026, "link" : "/api/reference/15677026", "label" : "37. Ling, A.C.H., Colbourn, C.J., Grannell, M.J., Griggs, T.S., Construction techniques for anti-Pasch Steiner triple systems (2000) J. Lond. Math. Soc. (2), 61, pp. 641-657", "listPosition" : 37, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677027, "link" : "/api/reference/15677027", "label" : "38. Stinson, D.R., Wei, Y.J., Some results on quadrilaterals in Steiner triple systems (1992) Discrete Math., 105, pp. 207-219", "listPosition" : 38, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677028, "link" : "/api/reference/15677028", "label" : "39. Grannell, M.J., Griggs, T.S., Phelan, J.S., A new look at an old construction for Steiner triple systems (1988) Ars. Combinat., 25 A, pp. 55-60", "listPosition" : 39, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677029, "link" : "/api/reference/15677029", "label" : "40. Brouwer, A.E., (1977) Steiner Triple Systems Without Forbidden Subconfigurations, , Mathematisch Centrum Amsterdam", "listPosition" : 40, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677030, "link" : "/api/reference/15677030", "label" : "41. Colbourn, C.J., Mendelsohn, E., Rosa, A., Iráň, J., Anti-Mitre Steiner triple systems (1994) Graphs Combin., 10, pp. 215-224", "listPosition" : 41, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677031, "link" : "/api/reference/15677031", "label" : "42. Grannell, M.J., Griggs, T.S., Mendelsohn, E., A small basis for four-line configurations in Steiner triple systems (1995) J. Combin. Des., 3, pp. 51-59", "listPosition" : 42, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677032, "link" : "/api/reference/15677032", "label" : "43. Colbourn, C.J., The configuration polytope of l-line configurations in Steiner triple systems (2009) Mathematica Slovaca, 59 (1), pp. 77-108", "listPosition" : 43, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677033, "link" : "/api/reference/15677033", "label" : "44. Wohl, P., Waicukauski, J.A., Williams, T.W., Design of compactors for signature-analyzers in built-in-self-test (2001) Proc. Int. Test Conf., pp. 54-63", "listPosition" : 44, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677034, "link" : "/api/reference/15677034", "label" : "45. Erdos, P., Frankl, P., Füredi, Z., Families of finite sets in which no set is covered by the union of others (1985) Israel J. Math., 51, pp. 75-89", "listPosition" : 45, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677035, "link" : "/api/reference/15677035", "label" : "46. Hanani, H., The existence and construction of balanced incomplete block designs (1961) Ann. Math. Statist., 32, pp. 361-386", "listPosition" : 46, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677036, "link" : "/api/reference/15677036", "label" : "47. Hanani, H., On balanced incomplete block designs with blocks having five elements (1972) J. Combin. Theory Ser. A, 12, pp. 184-201", "listPosition" : 47, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677037, "link" : "/api/reference/15677037", "label" : "48. Wilson, R.M., An existence theory for pairwise balanced designs. III. Proof of the existence conjectures (1975) J. Combin. Theory Ser. A, 18, pp. 71-79", "listPosition" : 48, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677038, "link" : "/api/reference/15677038", "label" : "49. (2007) Handbook of Combinatorial Designs, , C. J. Colbourn and J. H. Dinitz, Eds. Boca Raton, FL: Chapman and Hall/CRC", "listPosition" : 49, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677039, "link" : "/api/reference/15677039", "label" : "50. Chee, Y.M., Colbourn, C.J., Ling, A.C.H., Asymptotically optimal erasure-resilient codes for large disk arrays (2000) Discrete Appl. Math., 102, pp. 3-36", "listPosition" : 50, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677040, "link" : "/api/reference/15677040", "label" : "51. Müller, M., Jimbo, M., Erasure-resilient codes from affine spaces (2004) Discrete Appl. Math., 143, pp. 292-297", "listPosition" : 51, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677041, "link" : "/api/reference/15677041", "label" : "52. Mehlhorn, K., (1984) Data Structures and Algorithms, 1. , Berlin Germany: Springer", "listPosition" : 52, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677042, "link" : "/api/reference/15677042", "label" : "53. Tonien, D., Safavi-Naini, R., Recursive constructions of secure codes and hash families using difference function families (2006) J. Combin. Theory Ser. A, 113, pp. 664-674", "listPosition" : 53, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677043, "link" : "/api/reference/15677043", "label" : "54. Van Trung, T., Martirosyan, S.S., Newconstructions for IPP codes (2005) Des. Codes Cryptgr., 32, pp. 227-239", "listPosition" : 54, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677044, "link" : "/api/reference/15677044", "label" : "55. Deng, D., Stinson, D.R., Wei, R., The Lovász local lemma and its applications to some combinatorial arrays (2004) Des. Codes Cryptgr., 32, pp. 121-134", "listPosition" : 55, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677045, "link" : "/api/reference/15677045", "label" : "56. Walker, I.I.R.A., Colbourn, C.J., Perfect hash families: Construction and existence (2007) J. Math. Cryptol., 1, pp. 125-150", "listPosition" : 56, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677046, "link" : "/api/reference/15677046", "label" : "57. Martirosyan, S.S., Van Trung, T., Explicit constructions for perfect hash families (2008) Des. Codes Cryptogr., 46 (1), pp. 97-112", "listPosition" : 57, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677047, "link" : "/api/reference/15677047", "label" : "58. Wang, H., Xing, C., Explicit constructions of perfect hash families from algebraic curves over finite fields (2001) J. Combin. Theory Ser. A, 93, pp. 112-124", "listPosition" : 58, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677048, "link" : "/api/reference/15677048", "label" : "59. Colbourn, C.J., Constructing perfect hash families using a greedy algorithm (2008) Coding Cryptol., pp. 109-118. , Y. Li, S. Zhang, S. Ling, H. Wang, C. Xing, and H. Niederreiter, Eds. Singapore: World Scientific", "listPosition" : 59, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 15677049, "link" : "/api/reference/15677049", "label" : "60. Mitra, S., Lumetta, S.S., Mitzenmacher, M., X-tolerant signature analysis (2004) Proc. Int. Test Conf., pp. 432-441", "listPosition" : 60, "published" : false, "snippet" : true } ], "hasCitationDuplums" : false, "userChangeableUntil" : "2017-12-31T23:00:00.000+0000", "publishDate" : "2013-01-23T23:00:10.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 4, "ownerInstituteCount" : 15, "directInstituteCount" : 0, "authorCount" : 2, "contributorCount" : 0, "hasQualityFactor" : false, "link" : "/api/publication/22832300", "label" : "Fujiwara Y et al. A combinatorial approach to X-tolerant compaction circuits. (2010) IEEE TRANSACTIONS ON INFORMATION THEORY 0018-9448 1557-9654 56 7 3196-3206", "template" : "