中文
相关论文

相关论文: Number field lattices achieve Gaussian and Rayleig…

200 篇论文

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

信息论 · 计算机科学 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…

信息论 · 计算机科学 2018-08-28 Ahmed Hindy , Aria Nosratinia

The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is…

信息论 · 计算机科学 2016-11-18 Tobias Koch , Amos Lapidoth

Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…

信息论 · 计算机科学 2013-09-11 Ebrahim MolavianJazi , J. Nicholas Laneman

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

信息论 · 计算机科学 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

信息论 · 计算机科学 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

We answer a question of Peikert and Rosen by giving for each $\epsilon > 0$ an efficient construction of infinite families of number fields $N$ such that the root discriminant $D_N^{1/[N:\mathbb{Q}]}$ is bounded above by a constant times…

数论 · 数学 2026-01-27 Frauke M. Bleher , Ted Chinburg

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

信息论 · 计算机科学 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

We consider p-extensions of number fields such that the filtration of the Galois group by higher ramification groups is of prescribed finite length. We extend well-known properties of tame extensions to this more general setting; for…

数论 · 数学 2007-05-23 Farshid Hajir , Christian Maire

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

信息论 · 计算机科学 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

信息论 · 计算机科学 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…

数论 · 数学 2026-05-25 Brandon Alberts , Alina Bucur

A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is…

信息论 · 计算机科学 2011-06-07 Uri Erez , Mitchell D. Trott , Gregory W. Wornell

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

信息论 · 计算机科学 2007-08-22 Yingbin Liang , H. Vincent Poor

Given a general channel, we first formulate the idetification capacity problem as well as the resolvability problem with input cost constraint in as the general form as possible, along with relevant fundamental theorems. Next, we establish…

概率论 · 数学 2007-05-23 Te Sun Han

We study the capacity of the discrete-time Gaussian channel when its output is quantized with a one-bit quantizer. We focus on the low signal-to-noise ratio (SNR) regime, where communication at very low spectral efficiencies takes place. In…

信息论 · 计算机科学 2013-04-08 Tobias Koch , Amos Lapidoth

We discuss space-time chaos and scaling properties for classical non-Abelian gauge fields discretized on a spatial lattice. We emphasize that there is a ``no go'' for simulating the original continuum classical gauge fields over a long time…

高能物理 - 理论 · 物理学 2008-02-03 Holger Bech Nielsen , Hans Henrik Rugh , Svend Erik Rugh

In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to…

信息论 · 计算机科学 2011-02-25 I-Hsiang Wang

We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal…

信息论 · 计算机科学 2018-07-18 Linda Senigagliesi , Marco Baldi , Stefano Tomasin

The Hamiltonian formulation of lattice gauge theories plays a central role in quantum simulations of gauge theories, and understanding their spectrum and other properties is expected to become crucial in the upcoming years. The relevant…

高能物理 - 格点 · 物理学 2026-04-20 Thea Budde , Marina Kristć Marinković , Joao C. Pinto Barros