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 consider the broadcasting of a single Gaussian source over a two-user Gaussian broadcast channel with bandwidth expansion. In addition to the source broadcasting the encoder sends a message reliably to the “higher quality” user. Conditioned on the message rate, we derive an outer bound on the set of attainable mean-squared error distortion pairs at the two users which extends the Reznic-Feder-Zamir...
Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy, but also achieve low computational complexity. They are constructed by encoding k information columns into r parity columns, in which each element in a column is a bit, such that any k out of the k + r columns suffice...
Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single-erasure...
This paper asks how much we can gain in terms of bandwidth and user satisfaction, if recommender systems became bandwidth aware and took into account not only the user preferences, but also the fact that they may need to serve these users under bandwidth constraints, as is the case over wireless networks. We formulate this as a new problem in the context of index coding: we relax the index coding...
The study of regenerating codes has advanced tremendously in recent years. However, most known constructions require large field size, and hence may be hard to implement in practice. In this paper, by using notions from field theory and matrix analysis to restructure known coding techniques, two explicit constructions of regenerating codes are obtained. These codes approach the cut-set bound as the...
We study the problem of reducing the communication overhead from a wire-tap channel or storage system where data is encoded as a matrix, when more columns (or their linear combinations) are available. We present its applications to universal secure linear network coding and secure distributed storage with crisscross erasures. Our main contribution is a method to transform coding schemes based on linear...
In distributed storage, erasure codes are widely used to provide data reliability, where every codeword symbol corresponds to one storage node. The network traffic cost during the repair of node failures, called repair bandwidth, is an important metric in code design. In particular, minimum storage regenerating (MSR) codes are maximum distance separable (MDS) codes that have optimal repair bandwidth...
This paper studies the communication efficiency of threshold secret sharing schemes. We construct a family of Shamir's schemes with asymptotically optimal decoding bandwidth for arbitrary parameters. We also construct a family of secret sharing schemes with both optimal decoding and optimal repair bandwidth for arbitrary parameters. The construction leads to a family of regenerating codes allowing...
Minimum energy required to achieve a distortion-noise profile, i.e., a function indicating the maximum allowed distortion value for each noise level, is studied for robust transmission of Gaussian sources over Gaussian channels. It is shown that for the inversely linear profile, uncoded transmission is optimal. On the other hand, it turns out that exponential profiles are not achievable with finite...
A distributed binary hypothesis testing problem, in which multiple observers transmit their observations to a detector over noisy channels, is studied. Together with its own observations, the goal of the detector is to decide between two hypotheses for the joint distribution of the data. Single-letter upper and lower bounds on the optimal type 2 error exponent (T2-EE), when the type 1 error probability...
Erasure coding is an established data protection mechanism. It provides high resiliency with low storage overhead, which makes it very attractive to storage systems developers. Unfortunately, when used in a distributed setting, erasure coding hampers a storage system's performance, because it requires clients to contact several, possibly remote sites to retrieve their data. This has hindered the adoption...
Many video streaming services employ the dynamic adaptive streaming over HTTP (DASH) technique to achieve better user's QoE. Named-data Networking (NDN) can bring many benefits to the video distribution with in-network cache and stateful forwarding. However, simply applying DASH technique to NDN causes problems. First, in-network cache may affect download time which makes bitrate adaptation a difficult...
Robust linear analog block coding of a correlated Gaussian source over a Rayleigh fading channel, without encoderside channel-state information (CSI) is investigated. The encoder which minimizes the minimum mean square error, averaged over an ensemble of decoders whose channel gains are drawn from an exponential distribution is derived. This encoder does not require CSI. It is compared with a CSI-adaptive,...
It is necessary to transmit the image from the ammunition platform to the terrestrial system in real time when the TV guided weapon strikes the ground target. For the large amount of HDTV images, due to the limited bandwidth of signal transmission, real-time transmission can't be realized. As an emerging theory, compressive sensing provides the possibility of real-time transmission of HDTV video signals...
Wireless sensor networks (WSNs) have significant limitations in available bandwidth and energy. The limited bandwidth in sensor networks can cause higher message delivery latency. In this demo, we demonstrate working of novel Zorder based data compression schemes (Z- compression) to reduce energy and save bandwidth without increasing the message delivery latency using a TelosB motes based sensor network...
We introduce a model of a combination of particular low density parity check (LDPC) code and quadrature-quadrature phase shift keying (Q2PSK) constellation for the application of the downlink of the unmanned aerial vehicle (UAV) data chain. This model is a modification of the combination of LDPC code and constant envelope Q2PSK (CEQ2PSK) constellation. It achieves higher bandwidth efficiency of 4/3...
Vehicular Ad-hoc Networks (VANETs) has witnessed significant attention from academia and industries, due to the growing number of applications and devices focusing on safety and efficiency in transportation. Video Streaming in Vehicular Communication (VSVC) presents interactive real-time view of an emergency incidence on roads. On-board unit of vehicles are utilized for streaming real time video of...
Recently, HTTP-based adaptive video streaming has been widely adopted in the Internet. Up to now, HTTP-based adaptive video streaming is standardized as Dynamic Adaptive Streaming over HTTP (DASH), where a client-side video player can dynamically pick the bitrate level according to the perceived network conditions. Actually, not only the available bandwidth is varying, but also the chunk sizes in...
360 degree video compression and delivery is one of the key components of virtual reality (VR) applications. In such applications, the users may freely control and navigate the captured 3D environment from any viewing direction. Given that only a small portion of the entire video is watched at any time, fetching the entire 360 degree raw video is therefore unnecessary and bandwidth-consuming. In this...
This work presents two completely printable chipless RFID tags for low-cost item labeling. The first developed tag is based on circular ring resonators where each resonator codifies a tag coding notch position. Therefore, the tag structure is scalable, printable and compact size. Moreover, a novel encoding methodology is employed to preserve the notch width and position while coding. The second developed...
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.