DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hahn, Sang-Geun | - |
dc.contributor.advisor | 한상근 | - |
dc.contributor.advisor | Choi, U-Jin | - |
dc.contributor.advisor | 최우진 | - |
dc.contributor.author | Jeong, Eun-Ju | - |
dc.contributor.author | 정은주 | - |
dc.date.accessioned | 2011-12-14T04:56:19Z | - |
dc.date.available | 2011-12-14T04:56:19Z | - |
dc.date.issued | 2008 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=296235&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/42188 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2008.2, [ iii, 23 p. ] | - |
dc.description.abstract | Suppose $m$ and $t$ are integers such that $0 < t \leq m$. An $(m,t)$-splitting system is a pair $(X, \mathbf{B})$ where $|X|=m$, $\mathbf{B}$ is a set of subsets of $X$, called blocks such that for every $Y \subseteq X$ and $|Y|=t$, there exists a block $B \in \mathbf{\mathbf{B}}$ such that $|B \cup Y| = \lfloor t/2 \rfloor$. An $(m,t)$-splitting system is uniform if every block has size $\lfloor m/2 \rfloor$. We will give some results on uniform splitting systems for $t=3$. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Splitting system | - |
dc.subject | Uniform splitting system | - |
dc.subject | Discrete logarithm | - |
dc.subject | 스플리팅 시스템 | - |
dc.subject | 이산로그문제 | - |
dc.subject | Splitting system | - |
dc.subject | Uniform splitting system | - |
dc.subject | Discrete logarithm | - |
dc.subject | 스플리팅 시스템 | - |
dc.subject | 이산로그문제 | - |
dc.title | Constructions and bounds for (m,3)-uniform splitting system | - |
dc.title.alternative | (m,3)-Uniform Splitting System의 구조와 범위 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 296235/325007 | - |
dc.description.department | 한국과학기술원 : 수리과학과, | - |
dc.identifier.uid | 020063528 | - |
dc.contributor.localauthor | Hahn, Sang-Geun | - |
dc.contributor.localauthor | 한상근 | - |
dc.contributor.localauthor | Choi, U-Jin | - |
dc.contributor.localauthor | 최우진 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.