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.
We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff between decoding error, code rate and code length for such codes we introduce a quantum generalisation of the moderate deviation analysis proposed by Altŭg and Wagner...
The Yamamoto-Itoh (YI) scheme is a simple two phase coding scheme for discrete memoryless channels with noiseless feedback, which can attain the so-called Burnashev error-exponent. In this paper, we show how we can apply the YI scheme to discrete memoryless broadcast channels, and derive the achievable error-exponents region of the YI scheme for given coding rates.
Previous approaches to compute-and-forward (C&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C&F strategy over block fading channels using Construction A over rings, so as to allow better quantization for the channels. Advantages in decoding error probabilities and computation rates are demonstrated, and the construction is shown to outperform...
Concatenation of polar codes with cyclic redundancy check (CRC) codes, together with successive cancellation list (SCL) decoding, is known to be an effective approach that can significantly enhance the performance of the original polar codes. Most of the studies on the concatenation of CRC and polar codes, however, pay little attention to the structure of CRC codes themselves, even though the longer...
This paper investigates the error probability of a stochastic decision and the way in which it differs from the error probability of an optimal decision, i.e., the maximum a posteriori decision. This paper calls attention to the fact that the error probability of a stochastic decision with the a posteriori distribution is at most twice the error probability of the maximum a posteriori decision. It...
In this paper, a streaming transmission setup is considered where an encoder observes a new message in the beginning of each block and a decoder sequentially decodes each message after a delay of T blocks. In this streaming setup, the fundamental interplay between the coding rate, the error probability, and the blocklength in the moderate deviations regime is studied. For output symmetric channels,...
This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy...
It is shown that when Ankan's n-level polarization transformation is applied to the binary erasure channel, each of the resulting individual 2n subchannels has a sharp threshold, for sufficiently large n.
We derive the second order rates of joint source-channel coding, whose source obeys an irreducible and ergodic Markov process by introducing new distribution family, switched Gaussian convolution distribution, when the channel is a discrete memoryless. We also compare the joint source-channel scheme with the separation scheme in the second order regime.
This paper studies expurgated random-coding bounds and error exponents for joint source-channel coding (JSCC). We extend Gallager's expurgation techniques for channel coding to the JSCC setting, and derive a non-asymptotic bound that recovers two exponents derived by Csiszár using the method of types. Our approach has the notable advantage of being directly applicable to channels with continuous alphabets.
This paper considers a multimessage network where each node may send a message to any other node in the network. Under the discrete memoryless model, we prove the strong converse theorem for any network with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any network with tight cut-set bound and any fixed rate vector that resides outside the capacity region,...
We design polar codes of blocklength n→∞ and code rate R →1 that achieve the vanishing output error rates on the binary symmetric channels with transition error probability p → 0. These codes have a substantially smaller redundancy order (1 − R)n than do other known high-rate codes, such as Reed-Muller (RM) or BCH codes. The construction is explicit and has complexity of order nlog n. We also design...
This paper establishes non-asymptotic tradeoffs between detection delay, output sampling rate, and communication rate for bursty communication. These tradeoffs imply regimes where the gap to capacity is captured by the inverse of the sampling rate rather than the usual dispersion.
Multithreshold decoders (MTD) for the self-orthogonal codes (SOC) are considered. It is shown that applying of MTD for the well chosen codes provides almost optimum decoding. Noted that MTD using is difficult to provide a low decoding error probability at the a large noise level due to a small code distance of SOC. For reducing the error probability we propose a concatenated coding scheme formed by...
Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available...
We propose a new construction algorithm for Polar codes operating over Additive White Gaussian Noise channels under Successive Cancellation decoding. Our approach is based on tracking the bit error probabilities of the bit channels as they evolve through the decoder, allowing us on the one hand to characterize the performance of these channels, and on the other hand, providing a solid construction...
We consider a dual-hop wireless network where an energy constrained relay node first harvests energy through the received radio-frequency signal from the source, and then uses the harvested energy to forward the source's information to the destination node. The throughput and delay metrics are investigated for a decode-and-forward relaying mechanism at finite blocklength regime and delay-limited transmission...
The Internet of Things (IoT) is fueling innovation in nearly every part of our lives. From smart homes, cars, and cities, the Internet of Things is creating a more convenient, secure, intelligent, and personalized experience. While for any final user this IoT vision is a substantial innovation step, for communication providers is a compelling thread with massive number of devices connected to the...
We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of tests. We characterize the information-theoretic performance limits in the presence of list decoding, in which the decoder may output a list containing more elements than the number of defectives, and the only requirement is that the true defective set...
This paper investigates the problem of recovering an n-dimensional BPSK signal x0 ∈ {−1, 1}n from m-dimensional measurement vector y = Ax+z, where A and z are assumed to be Gaussian with iid entries. We consider two variants of decoders based on the regularized least squares followed by hard-thresholding: the case where the convex relaxation is from {−1, 1}n to ℝn and the box constrained case where...
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.