English
Related papers

Related papers: Asymptotic Performance of Coded Slotted ALOHA with…

200 papers

In the recent past, new enhancements based on the well established Aloha technique (CRDSA, CRDSA++, IRSA) have demonstrated the capability to reach higher throughput than traditional SA, in bursty traffic conditions and without any need of…

Information Theory · Computer Science 2015-01-26 Alessio Meloni , Maurizio Murroni

We extend the single-site coherent potential approximation (CPA) to include the effects of non-local disorder correlations (alloy short-range order) on the electronic structure of random alloy systems. This is achieved by mapping the…

Strongly Correlated Electrons · Physics 2009-11-10 M. S. Laad , L. Craco

Limitation of the cost of coordination and contention among a large number of nodes calls for grant-free approaches, exploiting physical layer techniques to solve collisions. Successive Interference Cancellation (SIC) is becoming a key…

Signal Processing · Electrical Eng. & Systems 2024-06-28 Andrea Baiocchi , Asmad Razzaque

Introducing controlled overlap among a few repetition blocks yields a fourfold asymptotic rate improvement while preserving an average stabilizer weight of \(4\). Substituting the overlapped outer layer with an LDPC code further produces a…

Information Theory · Computer Science 2025-11-21 En-Jui Chang

An asymptotic technique is presented for finding the spectral efficiency of multi-antenna links in wireless networks where transmitters have Channel-State-Information (CSI) corresponding to their target receiver. Transmitters are assumed to…

Information Theory · Computer Science 2010-09-22 Siddhartan Govindasamy , Daniel W. Bliss , David H. Staelin

In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on…

Information Theory · Computer Science 2026-03-17 Shuo Shao , Chao Qi , Jincheng Dai

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

The logistic loss function is often advocated in machine learning and statistics as a smooth and strictly convex surrogate for the 0-1 loss. In this paper we investigate the question of whether these smoothness and convexity properties make…

Machine Learning · Computer Science 2014-05-16 Elad Hazan , Tomer Koren , Kfir Y. Levy

This paper studies the joint data and semantics lossy compression problem, i.e., an extension of the hidden lossy source coding problem that entails recovering both the hidden and observable sources. We aim to study the nonasymptotic and…

Information Theory · Computer Science 2024-08-20 Huiyuan Yang , Yuxuan Shi , Shuo Shao , Xiaojun Yuan

We consider an ad hoc network in which each multi-antenna transmitter sends independent streams to multiple receivers in a Poisson field of interferers. We provide the outage probability and transmission capacity scaling laws, aiming at…

Information Theory · Computer Science 2009-01-19 Marios Kountouris , Jeffrey G. Andrews

Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of…

Information Theory · Computer Science 2016-03-08 Jean Barbier , Mohamad Dia , Nicolas Macris

We study two-dimensional random sequential adsorption (RSA) of flat polygons and rounded squares aligned in parallel to find a transition in the asymptotic behavior of the kinetics of packing growth. Differences in the kinetics for RSA of…

Statistical Mechanics · Physics 2023-05-31 Michał Cieśla , Piotr Kubala , Aref Abbasi Moud

This paper investigates the security enhancement of an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network, where a distributed IRS enabled NOMA transmission framework is proposed to serve users…

Information Theory · Computer Science 2021-04-16 Zheng Zhang , Jian Chen , Qingqing Wu , Yuanwei Liu , Lu Lv , Xunqi Su

Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it…

Disordered Systems and Neural Networks · Physics 2015-05-13 Jack Raymond , David Saad

We consider a spectrum-sharing cognitive radio system with antenna selection applied at the secondary transmitter (ST). Based on the extreme value theory, we deduce a simple and accurate expression for the asymptotic distribution of the…

Information Theory · Computer Science 2015-06-18 Ruifeng Duan , Zhong Zheng , Riku Jäntti , Jyri Hämäläinen

The work establishes the exact performance limits of stochastic coded caching when users share a bounded number of cache states, and when the association between users and caches, is random. Under the premise that more balanced…

Information Theory · Computer Science 2021-01-12 Adeel Malik , Berksan Serbetci , Emanuele Parrinello , Petros Elia

We derive asymptotic normality of kernel type deconvolution density estimators. In particular we consider deconvolution problems where the known component of the convolution has a symmetric lambda-stable distribution, 0<lambda<= 2. It turns…

Statistics Theory · Mathematics 2007-06-13 A. J. van Es , H. -W. Uh

We report a detailed and systematic study of wave propagation through a stochastic absorbing random medium. Stochastic absorption is modeled by introducing an attenuation constant per unit length $\alpha$ in the free propagation region of…

Disordered Systems and Neural Networks · Physics 2009-10-31 Sandeep K. Joshi , Debendranath Sahoo , A. M. Jayannavar

We investigate the optimal carrier sensing threshold in random CSMA/CA networks considering the effect of binary exponential backoff. We propose an iterative algorithm for optimizing the carrier sensing threshold and hence maximizing the…

Information Theory · Computer Science 2013-12-23 Dong Min Kim , Seong-Lyun Kim

The typical complexity of Constraint Satisfaction Problems (CSPs) can be investigated by means of random ensembles of instances. The latter exhibit many threshold phenomena besides their satisfiability phase transition, in particular a…

Disordered Systems and Neural Networks · Physics 2019-03-29 Louise Budzynski , Federico Ricci-Tersenghi , Guilhem Semerjian
‹ Prev 1 8 9 10 Next ›