نتایج جستجو برای: combinatorial design theory

تعداد نتایج: 1707757  

Journal: :Annals of Pure and Applied Logic 1991

Journal: :Annals of Pure and Applied Logic 2013

Journal: :Springer proceedings in mathematics & statistics 2021

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets positive integers. $g_{\mathcal{B} }(n)$ count the number representations $n$ in form $n b_1\cdots b_h$, where $b_i \in B_i$ for all $i \{1,\ldots, h\}$. It is proved that $\liminf_{n\rightarrow \infty} g_{\mathcal{B} }(n) \geq 2$ implies $\limsup_{n\rightarrow \infty$.

Journal: :Journal of the Australian Mathematical Society 1973

2010
Yuichiro Fujiwara David Clark Vladimir Tonchev Peter Vandendriessche Maarten De Boeck

This paper develops a general theory for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes (EAQECCs) with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error corre...

Journal: :Mathematics of Computation 1975

Journal: :International Journal of Game Theory 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید