相关论文: Signature coding for OR channel with asynchronous …
In this paper, we show that nested lattice codes achieve the capacity of arbitrary channels with or without non-casual state information at the transmitter. We also show that nested lattice codes are optimal for source coding with or…
This paper investigates the capacity region of the optical intensity broadcast channels (OI-BCs), where the input is subject to a peak-intensity constraint, an average-intensity constraint, or both. By leveraging the decomposition results…
We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to…
This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length…
Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…
Optical orthogonal signature pattern codes (OOSPCs) have attracted wide attention as signature patterns of spatial optical code division multiple access networks. In this paper, an improved upper bound on the size of an…
It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…
It is known that, as opposed to point-to-point channel, separate source and channel coding is not optimal in general for sending correlated sources over multiuser channels. In some works joint source-channel coding has been investigated for…
We consider block codes whose rate converges to the channel capacity with increasing block length at a certain speed and examine the best possible decay of the probability of error. We prove that a moderate deviation principle holds for all…
Increasing network utilization is often considered as the holy grail of communications. In this article, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is discussed for single-source…
We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…
We consider over-the-air convex optimization on a $d-$dimensional space where coded gradients are sent over an additive Gaussian noise channel with variance $\sigma^2$. The codewords satisfy an average power constraint $P$, resulting in the…
The problem of blind identification of channel codes at a receiver involves identifying a code chosen by a transmitter from a known code-family, by observing the transmitted codewords through the channel. Most existing approaches for…
Link and node failures are common two fundamental problems that affect operational networks. Hence, protection of communication networks is essential to increase their reliability, performance, and operations. Much research work has been…
Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales…
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…
The multiple-input and multiple-output (MIMO) technique is regarded as a promising approach to boost the throughput and reliability of optical fiber communications. However, the fundamental limits of optical fiber MIMO systems with finite…
A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as…
In this paper, we consider the problem of variable-length coding over the class of memoryless binary asymmetric channels (BACs) with noiseless feedback, including the binary symmetric channel (BSC) as a special case. In 2012, Naghshvar et…
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…