Pith. sign in

REVIEW 3 major objections 4 minor 30 references

On the Fundamental Limits of MIMO Massive Access Communication

T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read In a MIMO massive access channel, the message-length capacity region collapses to a single sum-rate constraint.

desk verdict Useful MIMO many-access results, but the central capacity-region achievability proof rests on a misapplied SLLN and needs repair before the main theorem is credible. read the letter →

arxiv 1908.03298 v1 pith:JL6DRJAW submitted 2019-08-09 cs.IT math.IT

Fan Wei , Yongpeng Wu , Wen Chen , Yanlin Geng , Giuseppe Caire This is my paper · ORCID
classification cs.ITmath.IT MSC 94A1594A40
keywords massiveaccesschannelMIMOmany-accessmessage-lengthcapacityrandomcompressedsensingsuccessiveinterferencecancellation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Many machine-type networks have more active users than coding blocklength, so per-user rates in bits per channel use vanish and the meaningful performance measure is message length. This paper claims that for such a MIMO many-access channel, the capacity region is a single linear constraint: every active user can send at a message-length rate equal to its codebook-size share $c_k$ of the expected log-determinant sum capacity, and random activity subtracts the entropy $\ell_n H_2(\alpha_n)$ from that sum budget. If true, the region collapses from exponentially many subset constraints to one sum constraint, and rate allocation is determined by codebook sizes rather than by SINR. The paper also claims that successive interference cancellation cannot drive the error probability to zero when the receiver has a finite number of antennas, and becomes viable only when the number of receive antennas grows with the blocklength.

What carries the argument

The paper's central objects are the message-length rate $R_k(n)=\log M_k$ and the mutual-information budget $I=\mathbb{E}_H \log\det\bigl(I_{N_R}+\sum_{t\in A} H_t Q_t H_t^\dagger\bigr)$, the expected log-determinant of the received covariance. The message-length notion matters because with $k_n=O(n)$ active users the conventional per-channel-use rate tends to zero, while $\log M_k$ remains meaningful. The rate-region proof uses the classical error-exponent method with a $\rho$-trick and i.i.d. Gaussian codebooks; the exponent is shown positive when each user takes a codebook-share $c_k$ of the sum budget. For the identification phase, the key tool is a concentration inequality on the conditional information density of the signature channel, which converts uncertainty counts into the signature-length threshold of Theorem 1. The asymptotic simplification is the channel-hardening identity $\det\bigl(I_{N_R}+\sum_t H_t Q_t H_t^\dagger\bigr)\to (1+\sum_t \beta_t p_t)^{N_R}$, which turns the region into a single closed-form linear constraint.

What would settle it

Compute, for fixed small $N_R$ and $k_n=\Theta(n)$ with i.i.d. Gaussian small-scale fading, the ratio of $\mathbb{E}_H \log\det\bigl(I_{N_R}+\sum_{t\in A} H_t Q_t H_t^\dagger\bigr)$ to $N_R \log(1+\sum_{t\in A}\beta_t p_t)$; if the ratio stays bounded away from 1 as $n$ grows, the hardening identity behind the positive error exponent fails. Alternatively, simulate the random-coding error exponent in Appendix D at finite $n$ and check whether it is positive along the claimed boundary.

Watch

Extended reading notes

Core claim

For a MIMO multiple-access channel where the number of active users $k_n$ grows linearly with blocklength $n$ and the receiver has a fixed number $N_R$ of antennas, the paper's central claim is that the achievable message-length region is governed by one sum-rate budget: each active user's message-length rate satisfies $R_k(n) \le c_k \, \mathbb{E}_H \log\det\bigl(I_{N_R} + \sum_{t\in A} H_t Q_t H_t^\dagger\bigr)$, where $c_k = \lim_n n \mu_k^{(n)}$ and $\mu_k^{(n)}$ is that user's share of the total codebook size. With random user activity, a further $\ell_n H_2(\alpha_n)$ bits are subtracted from the sum budget, so the finite-dimensional region is the single linear constraint $\sum_{j=1}^J K_j V_j(n) \le n\,\mathbb{E}_H \log\det\bigl(I_{N_R}+\sum_{t\in A} H_t Q_t H_t^\dagger\bigr) - \ell_n H_2(\alpha_n)$. The paper further claims that in the large-$n$ limit channel hardening turns the determinant into $(1+\sum_t \beta_t p_t)^{N_R}$, making individual rates grow like $c_k N_R \log n$, and that successive interference cancellation works only when $N_R$ itself grows with $n$.

Load-bearing premise

The proof of the achievable region assumes that, as the number of active users grows, the random determinant of the received covariance converges to the deterministic value $(1+\sum_{t\in A}\beta_t p_t)^{N_R}$; if the channel does not harden in that way, the error-exponent argument does not establish the claimed rates.

Editorial extensions

If this is right

  • Per-user rate allocation is set by codebook-size shares $c_k$, so system design separates into choosing $c_k$ to meet individual message-length targets and then meeting one sum-rate budget.
  • The activity-identification penalty $\ell_n H_2(\alpha_n)$ is subtracted from the same sum budget; when that penalty reaches the full budget ($\theta_n \ge 1$), no data transmission is possible.
  • Successive interference cancellation cannot drive error probability to zero with finite $N_R$; a receiver that relies on SIC must let $N_R$ grow with blocklength.
  • In the large-$n$ limit, channel hardening makes the region depend only on path losses, powers, and antenna count, with each user's rate growing as $c_k N_R \log n$.
  • The finite-dimensional capacity region of the massive random access channel is one linear constraint instead of the exponentially many subset constraints of a conventional MAC.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the single-constraint region is tight, the main design freedom is the allocation of codebook-size fractions $c_k$; scheduling, user identification, and data-rate allocation decouple in the asymptotic regime.
  • The hardening identity is the fragile step, so a natural test is to compare the claimed region against non-asymptotic finite-blocklength bounds for moderate $n$; a finite-$n$ gap would affect every user's rate proportionally.
  • The same one-budget structure might extend to shared-codebook (unsourced) random-access models, where the $c_k$ allocation would become per-user shares of a common codebook; the paper does not develop that connection.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper studies a MIMO massive access channel in which the number of potential users, and typically also the number of active users, grows unboundedly with the coding blocklength n. The authors propose a message-length capacity formulation, quantify the cost of user identification in a compressed-sensing training phase (Theorem 1), characterize the asymmetric message-length rates when the active set is known (Theorem 2), and then combine these to state a finite-dimensional capacity region for random access (Theorem 3, Eq. (21)). The central claim is that this region reduces to a single sum constraint, in contrast to the exponentially many subset constraints of classical MAC theory. The proofs use Gallager-type random-coding exponents, Bernstein-type concentration inequalities, and a claimed asymptotic deterministic-equivalent form for the determinant of the received covariance matrix based on Kolmogorov's strong law of large numbers.

Significance. If the results were fully established, this would be a substantial contribution: it extends the many-access channel framework to MIMO, gives an information-theoretic characterization of the user-identification cost, and predicts that the capacity region collapses to one linear constraint. The paper is self-contained, does not rely on fitted parameters, states explicit formulas that are checked against simulations, and addresses an important question in massive machine-type communication. The main weakness is that a load-bearing achievability proof rests on an invalid application of the strong law of large numbers, so the central capacity-region claim is not currently supported as written.

major comments (3)
  1. [Appendix D, Eqs. (161)-(164)] The asymptotic determinant equivalence used to prove Proposition 2 is not established. For i ≠ j, the entries g_{i,j}^{(t)} are independent across t with zero mean and variance of order 1, so the sum Σ_{t∈A} g_{i,j}^{(t)} has variance Θ(k_n) and does not converge to 0 as k_n→∞; Kolmogorov's SLLN gives (1/k_n) Σ_t g_{i,j}^{(t)} → 0, not the unnormalized convergence asserted in Eq. (161). Consequently Eqs. (163)-(164), and the simplifications in (165)-(166), do not follow from the stated argument. Since the lower bound E_r(ρ, A_l) ≥ c_0 > 0 in Proposition 2 is the load-bearing step for the achievability of Theorem 2, and hence for Theorem 3 and Eq. (21), the main claim of the paper is not proved by the written argument. A correct proof of the needed log-determinant asymptotics (or an alternative lower bound on the error exponent) is required.
  2. [Section VI-A, Eqs. (77)-(79)] The proof that the maximum in Eq. (14) is attained at i = k_ℓ is heuristic and is load-bearing for the formula n0 = log(ℓ choose k_ℓ)/I in Eq. (82), and therefore for the subtraction term ℓ_n H2(α_n) in the capacity region. The argument that the binary entropy function 'increases at a much faster speed' than the logarithm, and the associated inequality (79), are not a rigorous comparison for all i ∈ [1, k_ℓ) under all scalings with ℓ ≫ k_ℓ. A formal proof of this maximizer claim is needed to justify the identification-cost expression used in Theorem 3.
  3. [Section VI-A, proof of Theorem 3] Theorem 3 is stated as an exact capacity characterization, but the proof in Section VI-A only demonstrates achievability (the lower bound in Eqs. (83)-(85)). No matching converse for the random-access setting is provided: the converse in Section V-B applies to the known-active-set channel and does not account for the entropy of the active user set, so it does not yield the upper bound Σ_j K_j V_j(n) ≤ n E log det(I + Σ H_t Q_t H_t†) - ℓ_n H2(α_n). The missing upper bound (e.g., a Fano-type inequality involving both the message entropies and the entropy of the activity pattern) must be written out to justify the word 'capacity' in Theorem 3.
minor comments (4)
  1. [Appendix B, Eq. (55) and surrounding text] The proof of Proposition 1 repeatedly invokes choosing δ2 'sufficiently slowly' and 'sufficiently large implied constant' without specifying how these choices interact with the constants in (52) and (55). The argument would be much clearer if the constants were tracked explicitly, or the relevant asymptotics stated as a lemma.
  2. [Section III, Eq. (19) and Fig. 4] The paper notes that data transmission becomes impossible when θ_n ≥ 1, but the main theorems are stated only for 0 < θ_n < 1. A brief discussion of the θ_n ≥ 1 regime (e.g., whether the region is empty or the model needs modification) would help the reader interpret the figures.
  3. [Appendix D, Eq. (166)] The expression N_R O(log(2/γ)) is dimensionally confusing; since N_R is a constant and log(2/γ) is O(1), the right-hand side should simply be written as O(1), with the dependence on N_R made explicit in the final bound.
  4. [Figures 4 and 5] The figures plot θ on the right axis and sum rate on the left axis, but the caption and axis labels could be clearer about which curves correspond to which quantity, particularly since the legend entries appear twice with different line styles.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the MIMO massive-access rate formulas and identification-cost bounds are derived from standard information-theoretic tools without fitted inputs or load-bearing self-citations.

full rationale

The paper's central formulas are not assumed in their inputs. Theorem 1's identification-cost bound is derived from a maximum-likelihood decoder, Gallager's ρ-trick, and a concentration inequality for the information density (Lemma 1, proved in Appendix A from Bernstein's inequality). Theorem 2's achievability rests on a random-coding error exponent (Proposition 2), with the converse using Fano's inequality and data processing; the constants c_k and μ_k are codebook-size allocations, not parameters fitted to data. Theorem 3 is an algebraic combination of Theorems 1 and 2, subtracting the identification cost from the data rate. The self-citations [25] and [27] are contextual references to related massive-MIMO schemes and are not invoked to prove any theorem. The asymptotic channel-hardening step in Appendix D (Eqs. (161)-(164)) is a correctness concern about a misapplied strong law of large numbers, not a circularity: it relies on an external theorem [30] and does not assume the paper's target rate region. Definition 3 defines a finite-dimensional region using a single-sum condition, but the numerical content of that condition, namely the mutual-information sum rate and the ℓ_n H2(α_n) identification penalty, is derived from Theorems 1 and 2 rather than assumed. Overall, the derivation chain is self-contained given standard tools, and no prediction reduces by construction to an input.

Assumptions & free parameters 0 free parameters · 9 assumptions · 0 invented entities

The paper contains no fitted numerical parameters. The allocation factors c_k and rates are variables of the capacity region, not fitted constants. Powers p_k, number of antennas N_R, and large-scale fading β_k are system model inputs, not tuned to make the derivation work. No new physical entities or signals are introduced.

assumptions (9)
  • domain assumption Codewords for each user are i.i.d. CN(0, Q_k)
    Used in Deff 1 and Appendix C to compute the random coding error exponent. This is a standard random-coding assumption for achievability.
  • domain assumption Perfect CSIR at receiver, CDIT at transmitters
    Stated in Section II-A. All capacity and detection formulas assume the receiver knows the channel realizations for signature and data phases.
  • domain assumption User activity indicators are i.i.d. Bernoulli(α_n) with k_n = O(n) and condition (13)
    System model (Eqs. (1)-(3)) and Theorem 1's regime. The proofs assume k_n grows at most linearly with n and faster than log ℓ_n.
  • standard math Bernstein's inequality (concentration of sums of random variables)
    Used in Lemma 1 to prove the information density tail bound (24).
  • standard math Gallager's random coding error exponent and ρ trick
    Used in the union bound derivations, Eqs. (31)-(35) and (61)-(65).
  • standard math Kolmogorov strong law of large numbers
    Cited [30] and invoked in Appendix D to replace random channel sums by deterministic equivalents. The application is incorrect for the unnormalized off-diagonal sums.
  • standard math Dependence testing bound
    From [29], used in Section V-C to upper-bound SIC error probability.
  • standard math Fano's inequality
    Used in the converse of Theorem 2, Eq. (73).
  • ad hoc to paper Deterministic equivalent: det(I + Σ_{t∈A} H_t Q_t H_t†) ≈ (1 + Σ β_t p_t)^{N_R}
    Load-bearing for Proposition 2 (achievability of Theorem 2). The proof in Appendix D is invalid because off-diagonal sums are not convergent; the equivalence is asserted, not established.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On the Fundamental Limits of MIMO Massive Access Communication." pith.science (2026). https://pith.science/paper/JL6DRJAW

@misc{pith2026190803298,
  author       = {Pith},
  title        = {Pith review of: On the Fundamental Limits of MIMO Massive Access Communication},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JL6DRJAW}},
  note         = {Machine review of arXiv:1908.03298}
}
abstract

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC often assumes fixed and small number of the users. In this paper, we consider the massive access channel with multiple antennas system, where the base station (BS) with multiple receiving antennas serves the users in a single cell. The magnitude of users is assumed to grow unbounded with $n$. We investigate the achievable region of MIMO massive access channel, where among the total users, an unknown subset referred to active users may transmit data periodically. The asymptotic active user identification cost is also quantified. With the theoretical analysis, it was shown that given finite number of the receiving antennas, the individual rate for each user can be formulated as the sum rate multiplied by some specific factors, which correspond to the allocation of sum capacity. The successive decoding does not apply due to the interferences from growing unbounded users. Theoretical analysis shows that successive decoding works only when the number of receiving antennas goes to infinity with the increasing codelength.

Figures

Figures reproduced from arXiv: 1908.03298 by the authors.

Figure 1
Figure 1. MIMO massive random access network active or inactive depending on their data traffics, the uplink transmission can be divided into two phases. In the training phase, for the sake of user activity identification, the active UEs send signature signals to the base station (BS) with a signature length n0. Thereafter, the active UEs send codewords with a coding blocklength n − n0 in the data transmission phase. Let T = … view at source ↗
Figure 2
Figure 2. The relationship between sets A and Aˆ, where |A| = |A| ˆ = kn, |Amd| = |Afa| = i. To find the limits for UE identification, we assume ℓ → ∞ and let the other parameters change with ℓ. Theorem 1 provides the asymptotic UE identification cost for the centralized detection schemes. Theorem 1 (UE Identification Cost for Massive Random Access Channels): Denote the total number of users as ℓ and the number of active user… view at source ↗
Figure 3
Figure 3. Interpretation of compressed sensing from the view o [PITH_FULL_IMAGE:figures/full_fig_p021_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: The capacity of MIMO massive random access channel wi [PITH_FULL_IMAGE:figures/full_fig_p023_4.png]
Figure 5
Figure 5. Figure 5: The capacity of MIMO massive random access channel wi [PITH_FULL_IMAGE:figures/full_fig_p023_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 28 canonical work pages

  1. [1]

    Capacity of Gaussian man y-access channels,

    X. Chen, T.-Y . Chen, and D. Guo, “Capacity of Gaussian man y-access channels,” IEEE Trans. Inform. Theory , vol. 63, no. 6, pp. 3516–3539, Jun. 2017

    work page 2017

  2. [2]

    Gaussian many-access channels: Defin ition and symmetric capacity,

    X. Chen and D. Guo, “Gaussian many-access channels: Defin ition and symmetric capacity,” in Proc. IEEE Inf. Theory W orkshop, Seville, Spain, Sep. 2013, pp. 1–5

    work page 2013

  3. [3]

    Many-access channels: The Gaussian c ase with random user activities,

    X. Chen and D. Guo, “Many-access channels: The Gaussian c ase with random user activities,” in Proc. IEEE Int. Symp. Inf. Theory , Honolulu, HI, USA, Jun. 2014, pp. 3127–3131

    work page 2014

  4. [4]

    R. G. Gallager, Information Theory and Reliable Communication. New Y ork, NY , USA: Wiley, 1968

    work page 1968

  5. [5]

    Capacity of multi-antenna Gaussian channe ls,

    E. Telatar, “Capacity of multi-antenna Gaussian channe ls,” Eur . Trans. Telecomm., vol. 10, no. 6, pp. 585–596, Nov. 1999

    work page 1999

  6. [6]

    Capacity limits of MIMO channels,

    A. J. Goldsmith, S. A. Jafar, N. Jindal, and S. Vishwanath , “Capacity limits of MIMO channels,” IEEE J. Select. Areas Commun., vol. 21, no. 5, pp. 684–702, June 2003

    work page 2003

  7. [7]

    Capacity of multiple-antenna fadi ng channels: Spatial fading correlation, double scatterin g, and keyhole,

    H. Shin and J. H. Lee, “Capacity of multiple-antenna fadi ng channels: Spatial fading correlation, double scatterin g, and keyhole,” IEEE Trans. Inf. Theory , vol. 49, no. 10, pp. 2636–2647, Oct. 2003

    work page 2003

  8. [8]

    Noncooperative cellular wireless with un limited numbers of base station antennas,

    T. Marzetta, “Noncooperative cellular wireless with un limited numbers of base station antennas,” IEEE Trans. Wireless Commun., vol. 9, no. 11, pp. 3590–3600, Nov. 2010

    work page 2010

Show all 30 references
  1. [9]

    Compressed sensing,

    D. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006

    2006

  2. [10]

    Limits on support recov ery of sparse signals via multiple-access communication techniques,

    Y . Jin, Y .-H. Kim, and B. D. Rao, “Limits on support recov ery of sparse signals via multiple-access communication techniques,” IEEE Trans. Inf. Theory , vol. 57, no. 12, pp. 7877–7892, Dec. 2011

    2011

  3. [11]

    Sparse signa l processing with linear and nonlinear observations: A unifi ed Shannon-theoretic approach,

    C. Aksoylar, G. K. Atia, and V . Saligrama, “Sparse signa l processing with linear and nonlinear observations: A unifi ed Shannon-theoretic approach,” IEEE Trans. Inf. Theory , vol. 63, no. 2, pp. 749–776, Feb. 2017

    2017

  4. [12]

    Limits on support recovery w ith probabilistic models: An information-theoretic frame work,

    J. Scarlett and V . Cevher, “Limits on support recovery w ith probabilistic models: An information-theoretic frame work,” IEEE Trans. Inf. Theory , vol. 63, no. 1, pp. 593–620, Jan. 2017

    2017

  5. [13]

    Boucheron, G

    S. Boucheron, G. Lugosi, and P . Massart, Concentration Inequalities: A Nonasymptotic Theory of Ind ependence. Oxford U.K.: Oxford, Univ. Press, 2013

    2013

  6. [14]

    T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. Hoboken, NJ, USA: Wiley, 2006

    2006

  7. [15]

    Low-density co de-domain NOMA: Better be regular,

    O. Shental, B. M. Zaidel, and S. Shamai, “Low-density co de-domain NOMA: Better be regular,” in Proc. IEEE Int. Symp. Inf. Theory , Aachen, Germany, Jul. 2017, pp. 2628–2632

    2017

  8. [16]

    Sparse NOMA: A Cl osed-Form Characterization,

    B. M. Zaidel, O. Shental, and S. Shitz, “Sparse NOMA: A Cl osed-Form Characterization,” in Proc. IEEE Int. Symp. Inf. Theory, V ail, CO, USA, Jun. 2018, pp. 2157–8117. 37

    2018

  9. [17]

    Fundamental Limits of Low-Density Spreading NOMA With Fading,

    M. T. P . Le, G. C. Ferrante, T. Q. S. Quek, and M. D. Benedet to, “Fundamental Limits of Low-Density Spreading NOMA With Fading,” IEEE Trans. Wireless Commun. , vol. 17, no. 7, pp. 4648–4659, Jul. 2018

    2018

  10. [18]

    On information-theoretic limits of code-doma in NOMA for 5G,

    M. T. P . Le, G. C. Ferrante, G. Caso, L. D. Nardis, and M. D. Benedetto, “On information-theoretic limits of code-doma in NOMA for 5G,” IET Commun. , vol. 12, no. 15, pp. 1864–1871, Sep. 2018

    2018

  11. [19]

    Massive connectivity with massive MIM O-Part II: Achievable rate characterization,

    L. Liu and W. Y u, “Massive connectivity with massive MIM O-Part II: Achievable rate characterization,” IEEE Trans. Signal Process. , vol. 66, no. 11, pp. 2947-2959, 2018

    2018

  12. [20]

    Massive connectivity with massive MIM O-Part I: Device activity detection and channel estimation ,

    L. Liu and W. Y u, “Massive connectivity with massive MIM O-Part I: Device activity detection and channel estimation ,” IEEE Trans. Signal Process. , 2018, vol. 66, no. 11, pp. 2933–2946, 2018

    2018

  13. [21]

    Sparse activity detecti on for massive connectivity,

    Z. Chen, F. Sohrabi, and W. Y u, “Sparse activity detecti on for massive connectivity,” IEEE Trans. Signal Process. , vol. 66, no. 7, pp. 1890–1904, Apr. 2018

    1904

  14. [22]

    A perspective on massive random-acces s,

    Y . Polyanskiy, “A perspective on massive random-acces s,”in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 2523–2527, Jun. 2017

    2017

  15. [23]

    Low complexity schem es for the random access Gaussian channel,

    O. Ordentlich and Y . Polyanskiy, “Low complexity schem es for the random access Gaussian channel,” preprint. [Onli ne]. Available: http://www.mit.edu/ordent/publications/RandomAccessFull.pdf

  16. [24]

    A Coupled Compressi ve Sensing Scheme for Uncoordinated Multiple Access,

    V amsi K. Amalladinne et al. (2018) “A Coupled Compressi ve Sensing Scheme for Uncoordinated Multiple Access,” preprint. [Online]. Available: https://arxiv.org/abs/1 701.03620.pdf

    2018

  17. [25]

    Massive MIMO Unsourced Random Access,

    A. Fengler, G. Caire, P . Jung, and S. Haghighatshoar. (2 019) “Massive MIMO Unsourced Random Access,” preprint. [Online]. Available: https://arxiv.org/pdf/1901.00828.pdf

    1901 arXiv

  18. [26]

    Fundamental limi ts of many-user MAC with finite payloads and fading,

    S. Kowshik and Y . Polyanskiy, (2019) “Fundamental limi ts of many-user MAC with finite payloads and fading,” preprin t. [Online]. Available: http://people.lids.mit.edu/yp/ho mepage/data/manymac fading.pdf

    2019

  19. [27]

    A New S caling Law for Activity Detection in Massive MIMO Systems,

    S. Haghighatshoar, P . Jung, and G. Caire, (2019) “A New S caling Law for Activity Detection in Massive MIMO Systems,” preprint. [Online]. Available: https://arxiv.org/pdf/1 803.02288.pdf

    2019

  20. [28]

    Polyanskiy and Y

    Y . Polyanskiy and Y . Wu, Lecture Notes on Information Theory , [Online]. Available: http://www.stat.yale.edu/∼ yw562/teaching/itlectures.pdf

  21. [29]

    Channel coding rate in the finite blocklength regime,

    Y . Polyanskiy, H. V . Poor, and S. V erdu, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2307–2359, May 2010

    2010

  22. [30]

    P . K. Sen and J. M. Singer, Large Sample Methods in Statistics: An Introduction with Ap plications, New Y ork, Chapman & Hall, Inc. New Y ork 1993

    1993

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.