DC Field | Value | Language |
---|---|---|
dc.contributor.author | Roh, Dong-Young | ko |
dc.contributor.author | Hahn, Sang-Geun | ko |
dc.date.accessioned | 2013-03-12T16:41:04Z | - |
dc.date.available | 2013-03-12T16:41:04Z | - |
dc.date.created | 2013-01-18 | - |
dc.date.created | 2013-01-18 | - |
dc.date.issued | 2012-12 | - |
dc.identifier.citation | MATHEMATICAL COMMUNICATIONS, v.17, no.2, pp.639 - 654 | - |
dc.identifier.issn | 1331-0623 | - |
dc.identifier.uri | http://hdl.handle.net/10203/102895 | - |
dc.description.abstract | Suppose 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.language | English | - |
dc.publisher | UNIV OSIJEK, DEPT MATHEMATICS | - |
dc.title | Constructions for uniform (m, 3)-splitting systems | - |
dc.type | Article | - |
dc.identifier.wosid | 000311954500022 | - |
dc.identifier.scopusid | 2-s2.0-84871176377 | - |
dc.type.rims | ART | - |
dc.citation.volume | 17 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 639 | - |
dc.citation.endingpage | 654 | - |
dc.citation.publicationname | MATHEMATICAL COMMUNICATIONS | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.description.isOpenAccess | Y | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | splitting systems | - |
dc.subject.keywordAuthor | baby-step giant-step algorithms | - |
dc.subject.keywordAuthor | low Hamming weight discrete logarithm problem | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.