Related papers: Correction to "A Note on Gallager's Capacity Theor…
The Gallager bound is well known in the area of channel coding. However, most discussions about it mainly focus on its applications to memoryless channels. We show in this paper that the bounds obtained by Gallager's method are very tight…
We address a major flaw in the abovementioned paper, which proposes to calculate effective capacity of random channels by the use of central limit theorem. We analytically show that the authors are incorrect in finding the effective…
The channel capacity theorem for additive white Gaussian noise channel (AWGN), widely known as the Shannon-Hartley Law, expresses the information capacity of a channel bandlimited in the conventional Fourier domain in terms of the…
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit…
Following some ideas in the Landau book, some corrections about errors in the old literature on scalar gravitational waves are given and discussed. Even if such errors can be considered not important from the point of view of observations,…
In the note an error in Low and Lapsley's article ("Optimization Flow Control, I: Basic Algorithm and Convergence", IEEE/ACM Transactions on Networking, 7(6), pp. 861-874, 1999) is pointed out. Because of this error the proof of the Theorem…
This paper has been withdrawn by the author due to some errors.
The performance of Gallager's error-correcting code is investigated via methods of statistical physics. In this approach, the transmitted codeword comprises products of the original message bits selected by two randomly-constructed sparse…
This paper has been withdrawn due to an incorrect proof.
This paper has been withdrawn to provide a more rigorous proof of the converse of Theorem 1 and Lemma 1 as well.
It is shown that the criticism of Voitkiv [Phys. Rev. A 74, 027403 (2006)] is based on one assumption, which is false for an ionized electron, initially bound by the Coulomb potential, in a strong circularly polarized laser field. A certain…
Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the…
The heat channel is defined by a linear time-varying (LTV) filter with additive white Gaussian noise (AWGN) at the filter output. The continuous-time LTV filter is related to the heat kernel of the quantum mechanical harmonic oscillator, so…
Calin Galeriu(CG) has commented [1] about our manuscript, "Doppler signature in electrodynamic retarded potentials" [2], that must be properly addressed, amending at the same time of notation errors [3] to clarify some formal aspects which…
A comment on a recent Letter on the information capacity of nonlinear channels.
The use of multiple antenna arrays in transmission and reception has become an integral part of modern wireless communications. To quantify the performance of such systems, the evaluation of bounds on the error probability of realistic…
In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…
This paper has been withdrawn by the author because Lemma 3 is incorrect. This mistake is crucial in this paper.
We correct the statements of two theorems and two corollaries in our paper [On subgroup perfect codes in Cayley graphs, European J. Combin. 91 (2021) 103228]. Proofs of these theorems and three other results are given as well.
Capacity bounds for waveform channels under square-law detection of time-limited complex-valued signals are derived. The upper bound is the capacity of the channel under (complex-valued) coherent detection. The lower bound is one bit less,…