Related papers: Towards a complete DMT classification of division …
A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…
Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…
We prove new probabilistic upper bounds on generalization error of complex classifiers that are combinations of simple classifiers. Such combinations could be implemented by neural networks or by voting methods of combining the classifiers,…
The index coding problem aims to optimise broadcast communication by taking advantage of receiver-side information to improve transmission efficiency. In this letter, we explore the application of Construction $\pi_A$ lattices to index…
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…
We prove mean and pointwise ergodic theorems for general families of averages on a semisimple algebraic (or S-algebraic) group G, together with an explicit rate of convergence when the action has a spectral gap. Given any lattice in G, we…
This paper explores test-agnostic long-tail recognition, a challenging long-tail task where the test label distributions are unknown and arbitrarily imbalanced. We argue that the variation in these distributions can be broken down…
Adaptive optimization methods (such as Adam) play a major role in LLM pretraining, significantly outperforming Gradient Descent (GD). Recent studies have proposed new smoothness assumptions on the loss function to explain the advantages of…
Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…
Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…
Real-world object classes appear in imbalanced ratios. This poses a significant challenge for classifiers which get biased towards frequent classes. We hypothesize that improving the generalization capability of a classifier should improve…
Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse [1]. The SNR-asymptotic DMT overestimates the finite-SNR one [2]. This paper outlines a number of…
A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences…
In this two-part paper, the DMT of cooperative multi-hop networks is examined. The focus is on single-source single-sink (ss-ss) multi-hop relay networks having slow-fading links and relays that potentially possess multiple antennas. The…
We'll measure the differences of the dual variables and the gain of the objective function when creating new problems, which each has one inequality more than the starting LP-instance. These differences of the dual variables are naturally…
We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…
In theories with topological sectors, such as lattice QCD and four-dimensional SU(N) gauge theories with periodic boundary conditions, conventional update algorithms suffer from topological freezing due to large action barriers separating…
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…
The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint…
We discuss factorization of the hypergeometric-type difference equations on the uniform lattices and show how one can construct a dynamical algebra, which corresponds to each of these equations. Some examples are exhibited, in particular,…