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.
In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper...
We consider the problem of distance, or range, estimation by measuring the phase of a sinusoidal signal transmitted between two locations. The distance can only be unambiguously measured if it is contained in an interval of length less than the wavelength of the signal. To increase the length of this interval, multiple phase measurements at different wavelengths can be used. The identifiable range...
Device-to-device (D2D) communications can enhance the overall system capacity by reusing cellular spectrum, which at the same time leads to severe interference to cellular connections and vice versa. In practice, even when two wireless connections share the same spectrum, the interference between them may not always exist if there is no conflict at packet-level transmissions. Thus, in this paper,...
In this work the arbitrarily varying wiretap channel AVWC under the average error criterion and the strong secrecy criterion is studied. We show that in the case of a non-symmetrisable channel to the legitimate receiver the deterministic code secrecy capacity equals the random code secrecy capacity and thus we establish a result for the AVWC similar to that of Ahlswede's dichotomy for ordinary AVCs...
We propose the construction of a non-binary multiple insertion/deletion correcting code based on a binary multiple insertion/deletion correcting code. In essence, it is a generalisation of Tenengol'ts' non-binary single insertion/deletion correcting code. We evaluate the cardinality of the proposed construction based on the asymptotic upper bound on the cardinality of a maximal binary multiple insertion/deletion...
We consider data-streaming from an access point to multiple receivers, which is modeled as packet erasure channel. A simple network coding is shown to achieve larger rate region than without network coding, using minimal control information. The performance is characterized exactly using state transition graph. The scheme is then mapped to an information theoretic formulation for broadcast channel...
This paper presents a distributed fermat-point range estimation strategy, which is important in the moving sensor localization applications. The fermat-point is defined as a point which minimizes the sum of distances from three sensors inside a triangle. This point is indeed at the trianglepsilas center of gravity. We solve the problems of large errors and poor performance in the bounding box algorithm...
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.