The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
New multiple access techniques aim to increase the spectral efficiency by overloading the system, i.e., with those techniques the number of users served is greater than the number of system radio channels. Multicarrier-code division multiple access (MC-CDMA) allows the system to be overloaded when multiuser-maximum-likelihood-detector (MU-MLD) is used. Nevertheless, an overloaded system may be affected...
In this paper, we interpret the polar codes based on Plotkin construction perspective. We briefly review the rate allocation for component codes of Plotkin codes and the construction of polar codes based on Gaussian approximation. Then, we show that the recursively constructed Plotkin codes can be a class of polar codes. And also, the polar codes are a class of Plotkin code having minimum threshold.
We describe a successive cancellation list CRC (Cyclic Redundancy Check)-aided decoder for polar codes over AWGN (Additive White Gaussian Noise) Channel, Fading Channel and Impulsive Noise Channel. Simulation results show the advantage of this decoding method over the original proposed by Arikan.
In this paper, we propose a simple and efficient soft- in soft-out (SISO) equalization for block Markov superposition transmission (BMST) in the coded OFDM system (called BMST-OFDM) over high-mobility wireless communication channels. In the BMST-OFDM system, the proposed SISO equalizer can exchange soft messages with the soft demapper and the BMST decoder in an iterative fashion. Simulation results...
The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme [1]; and uses quasi-linear codes. A new single-letter achievable rate region is derived. The new achievable region strictly contains the CL region. This is shown through an example. In...
In this work, we study the problem of two-encoder multiterminal source coding with side information under logarithmic loss distortion measure. We establish a single-letter characterization of the rate-distortion region of this model in the discrete memoryless case. The proof of the converse relies heavily on that of Courtade-Weissman rate-distortion region of the classic two-encoder multiterminal...
In this article, we resolve open problem 8.2 in [1]. We show that superposition coding is sub-optimal for a three receiver broadcast channel with two message sets (M0, M1) where two of the three receivers need to decode messages M0, M1) while the remaining one just needs to decode the message M0.
We derive upper and lower bounds on the reliability function for the discrete memoryless broadcast channel with common message and variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically degraded. We adapt and supplement new ideas to Yamamoto and Itoh's two-phase coding scheme for the direct part and Burnashev's proof technique for the converse part.
We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
This paper Introduces the discrete memoryless multiple access wiretap channel with noiseless cribbing, where the cribbing may be either causal or strictly causal. We derive lower bounds for secrecy rates for both causal and strictly causal cribbing under either a decode-forward or partial-decode-forward strategy. Our results recover the achievable rate regions of the MAC wiretap and MAC with cribbing,...
The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analog-to-digital converter (ADC). It is proved that the input distributions that achieve the boundary points of the capacity region are discrete. Based on the position of a boundary point, upper bounds on the number of...
The K-user discrete memoryless (DM) broadcast channel (BC) with two degraded messages, with one common message to be decoded by all receivers and a private message by a subset of receivers, is studied. The receivers that must decode both messages are referred to as private receivers and the remaining ones that need only decode the common message as common receivers. We obtain two main results. The...
The second-order behavior of the discrete memoryless arbitrarily-varying channel is considered in the fixed error regime when the encoder and decoder share randomness that is independent from the adversarial choice of state. The dispersion (coefficient of the second-order term) is exactly characterized for most channels of interest when infinite shared randomness is allowed, and it is shown that precisely...
A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with up to exponentially many messages intended for any set of subsets of receivers. Achievability is based on superposition coding and rate-splitting, where each receiver jointly decodes...
This paper gives upper and lower bounds on the minimum error probability of Bayesian M-ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order α. The improved tightness of these bounds over their specialized versions with the Shannon conditional entropy (α = 1) is demonstrated. In particular, in the case where M is finite, we show how to generalize Fano's inequality...
A (K, N, T, Kc) instance of the MDS-TPIR problem is comprised of K messages and N distributed servers. Each message is separately encoded through an (N, Kc) MDS storage code. A user wishes to retrieve one message, as efficiently as possible, while revealing no information about the desired message index to any colluding set of up to T servers. The fundamental limit on the efficiency of retrieval,...
We characterize the information-theoretic limits of the Gaussian multiple access channel (MAC) when variable-length stop-feedback is available at the encoder and a non-vanishing error probability is permitted. Due to the continuous nature of the channel and the presence of expected power constraints, we need to develop new achievability and converse techniques. Due to the multi-terminal nature of...
In successive refinement of information, the decoder refines its representation of the source progressively as it receives more encoded bits. The rate-distortion region of successive refinement describes the minimum rates required to attain the target distortions at each decoding stage. In this paper, we derive a parametric characterization of the rate-distortion region for successive refinement of...
We prove polarization theorems for arbitrary classical-quantum (cq) channels. The input alphabet is endowed with an arbitrary Abelian group operation and an Arikan-style transformation is applied using this operation. It is shown that as the number of polarization steps becomes large, the synthetic cq-channels polarize to deterministic homomorphism channels that project their input to a quotient group...
In the network coding, we discuss the effect by sequential error injection to information leakage. We show that there is no improvement when the network is composed of linear operations. However, when the network contains non-linear operations, we find a counterexample to improve Eve's obtained information. Further, we discuss the asymptotic rate in the linear network under the secrecy and robustness...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.