Results 21 to 30 of about 332,390 (261)
On p-covalenced association schemes
Journal of Combinatorial Theory, Series A, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitsugu Hirasaka, Kyoung-Tark Kim
openaire +1 more source
ETRI Journal, 2023 A joint resource-optimization scheme is investigated for nonorthogonal multiple access (NOMA)-enhanced scalable video coding (SVC) multicast in unmanned aerial vehicle (UAV)-assisted radio-access networks (RANs).
Ziyuan Tong +4 more
doaj +1 more source
Secure User Association in Two-Tier Heterogeneous Cellular Networks With In-Band Interference
IEEE Access, 2018 In this paper, we address the issue of security-concerned user association in two-tier heterogeneous cellular networks with in-band interference. Different from the maximum secrecy capacity association (max-SC), which studied multi-tier heterogeneous ...
Shijie Wang +4 more
doaj +1 more source
On the Uniqueness of the Triangular Association Scheme [PDF]
The Annals of Mathematical Statistics, 1960 Connor [3] has shown that the relations among the parameters of the triangular association scheme themselves imply the scheme if $n \geqq 9$. This result was shown by Shrikhande [6] to hold also if $n \leqq 6$. (The problem has no meaning for $n < 4$.) This paper shows that the result holds if $n = 7$, but that it is false if $n = 8$.
openaire +2 more sources
On Quasi-thin Association Schemes
Journal of Combinatorial Theory, Series A, 2002 An association scheme is called quasi-thin if each of its basic relations has valency 1 or 2. In this paper three sufficient conditions for a quasi-thin scheme \((X,R)\) to have an automorphism group acting transitively on \(X\) are obtained: (i) \(O^\theta(R)\cap O_\theta(R)=\{1\}\) (Lemma 4.1), (ii) \(n_{O^\theta(R)}=2\) (Theorem 4.4), and (iii) \(R\)
Mitsugu Hirasaka, Mikhail E. Muzychuk
openaire +1 more source
IEEE Access, 2016 This paper addresses the issues of user association in multi-tier heterogeneous networks (HetNets) to reduce co-channel interference and provide load balancing for proactively offloading users onto mobile personal cells (mPC).
Zeeshan Kaleem, Kyunghi Chang
doaj +1 more source
Uniform Mixing and Association Schemes
The Electronic Journal of Combinatorics, 2017 We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing.First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform ...
Chris D. Godsil +2 more
openaire +3 more sources
Memory-Based User-Centric Backhaul-Aware User Cell Association Scheme
IEEE Access, 2018 Ultra-dense small cell networks represent a key future network solution that can help meet the exponentially rising traffic requirements of modern wireless networks. Backhauling these small cells are an emerging challenge to the extent that various cells
Farrukh Pervez +4 more
doaj +1 more source
Coverage Performance Comparison of DUDA and CUDA Schemes for Heterofeneous Network [PDF]
Jisuanji gongcheng, 2020 Aiming at the unbalanced load of Uplink(UL) and Downlink(DL) in the Heterogeneous Network(HetNet),this paper proposes a Decoupling UL and DL Association(DUDA) scheme.The probability density functions of primary and secondary UL access distances are ...
FAN Qiaoling, JIA Xiangdong, JI Pengshan, LU Yi
doaj +1 more source
Pareto–Optimal Design of Markov Chains on Networks Based on Association Schemes
IEEE AccessThe design of fast-mixing Markov chains is a fundamental problem with broad relevance to randomized algorithms, distributed computation, and sampling over networks.
Saber Jafarizadeh
doaj +1 more source