| 1. |
- Danev, Danyo, 1973-, et al.
(författare)
-
Multiple Access Adder Channel
- 2007
-
Ingår i: Multiple Access Channels - Theory and Practice. - Amsterdam : IOS Press. - 9781586037284 - 1586037285 ; , s. 26-53
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- While multiple-access communication dates back to systems invented in the 1870's to transmit simultaneous data through a single wire, the foundation of the discipline now known as 'multiuser information theory' was laid in 1961, when Claude E. Shannon published his paper on two-way channels. Since then, multiuser information theory has been an extremely active research area, and has seen a large number of fundamental contributions, covering, besides the two-way channel studied in, multiple access, interference, broadcast, and wiretap channels. However, several key canonical problems have defied many efforts. This book brings together leading experts working in the fields of information theory, coding theory, multiple user communications, discrete mathematics, etc., who survey recent and general results on multiple-access channels (rate regions, rate splitting, etc.), and give an overview of the problems of current CDMA solutions (fading channels, multi-user detection, multiple-antenna systems, iterative joint decoding, OFDMA, etc.). This publication consist of three parts. The first part includes chapters devoted to the information-theoretical aspects of multiple-access communication. In the second part, multiple-access techniques are discussed and the third part of this volume covers coding techniques
|
|
| 2. |
- Danev, Danyo, 1973-, et al.
(författare)
-
Multiple Access Euclidean Channel
- 2007
-
Ingår i: Multiple Access Channels - Theory and Practice. - Amsterdam : IOS Press. - 9781586037284 - 1586037285 ; , s. 54-72
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- While multiple-access communication dates back to systems invented in the 1870's to transmit simultaneous data through a single wire, the foundation of the discipline now known as 'multiuser information theory' was laid in 1961, when Claude E. Shannon published his paper on two-way channels. Since then, multiuser information theory has been an extremely active research area, and has seen a large number of fundamental contributions, covering, besides the two-way channel studied in, multiple access, interference, broadcast, and wiretap channels. However, several key canonical problems have defied many efforts. This book brings together leading experts working in the fields of information theory, coding theory, multiple user communications, discrete mathematics, etc., who survey recent and general results on multiple-access channels (rate regions, rate splitting, etc.), and give an overview of the problems of current CDMA solutions (fading channels, multi-user detection, multiple-antenna systems, iterative joint decoding, OFDMA, etc.). This publication consist of three parts. The first part includes chapters devoted to the information-theoretical aspects of multiple-access communication. In the second part, multiple-access techniques are discussed and the third part of this volume covers coding techniques
|
|
| 3. |
- Janson, Svante, 1955-, et al.
(författare)
-
A modified bootstrap percolation on a random graph coupled with a lattice
- 2019
-
Ingår i: Discrete Applied Mathematics. - : Elsevier BV. - 0166-218X .- 1872-6771. ; 258, s. 152-165
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper a random graph model G(ZN2.pd) is introduced, which is a combination of fixed torus grid edges in (z/NZ)(2) and some additional random ones. The random edges are called long, and the probability of having a long edge between vertices u, v is an element of (Z/NZ)(2) with graph distance d on the torus grid is p(d) = c/Nd, where c is some constant. We show that, whp, the diameter D(G(zN2.pd)) = Theta(log N). Moreover, we consider a modified non-monotonous bootstrap percolation on G(ZN2.pd). We prove the presence of phase transitions in mean-field approximation and provide Fairly sharp bounds on the error of the critical parameters.
|
|
