Constructions for uniform (m, 3)-splitting systems

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 352
  • Download : 142
DC FieldValueLanguage
dc.contributor.authorRoh, Dong-Youngko
dc.contributor.authorHahn, Sang-Geunko
dc.date.accessioned2013-03-12T16:41:04Z-
dc.date.available2013-03-12T16:41:04Z-
dc.date.created2013-01-18-
dc.date.created2013-01-18-
dc.date.issued2012-12-
dc.identifier.citationMATHEMATICAL COMMUNICATIONS, v.17, no.2, pp.639 - 654-
dc.identifier.issn1331-0623-
dc.identifier.urihttp://hdl.handle.net/10203/102895-
dc.description.abstractSuppose m and t are integers such that 0 < t <= m. An (m, t)-splitting system is a pair (X, B), where \X\ = m and B is a set of subsets of X, called blocks, such that for every Y subset of X and \Y\ = t, there exists a block B is an element of B such that \B boolean AND Y\ = left perpendiculart/2rightperpendicular. An (m, t)-splitting system is uniform if every block has size left perpendicularm/2right perpendicular. We present new construction methods of uniform splitting systems for t = 3 that have a smaller number of blocks as compared to previous results.-
dc.languageEnglish-
dc.publisherUNIV OSIJEK, DEPT MATHEMATICS-
dc.titleConstructions for uniform (m, 3)-splitting systems-
dc.typeArticle-
dc.identifier.wosid000311954500022-
dc.identifier.scopusid2-s2.0-84871176377-
dc.type.rimsART-
dc.citation.volume17-
dc.citation.issue2-
dc.citation.beginningpage639-
dc.citation.endingpage654-
dc.citation.publicationnameMATHEMATICAL COMMUNICATIONS-
dc.contributor.localauthorHahn, Sang-Geun-
dc.description.isOpenAccessY-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorsplitting systems-
dc.subject.keywordAuthorbaby-step giant-step algorithms-
dc.subject.keywordAuthorlow Hamming weight discrete logarithm problem-
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0