Indoor positioning system is a critical part in location-based services. Highly precise systems can support different mobile applications future wireless systems. Positioning using existing networks have low deployment costs, but the position error be up to several meters. While there are proposed literature that error, they require extra hardware and therefore costly deploy. In this paper, we propose an indoor based on visible light communications (VLC). contrast works VLC for positioning,...

In this correspondence, a generalization of rateless codes is proposed. The proposed provide unequal error protection (UEP). asymptotic properties these under the iterative decoding are investigated. Moreover, upper and lower bounds on maximum-likelihood (ML) probabilities finite-length LT Raptor for both equal schemes derived. Further, our work verified with simulations. Simulation results indicate that desirable UEP. We also note UEP property does not impose considerable drawback overall...

An indoor positioning system is a key component in enabling location-based services future wireless networks. The need for highly accurate rapidly increasing. In the past couple of years, several systems based on visible light communications that achieve good accuracy have been proposed. Some these are assumptions such as complete knowledge height receiver, and exact alignment transmitter receiver normals to normal ceiling. other do not support user mobility because they require vary...

Estimating the coefficients of a noisy polynomial phase signal is important in fields including radar, biology and radio communications. One approach attempts to perform regression on signal. This complicated by fact that wrapped modulo 2π must be unwrapped before can performed. In this paper, we consider an estimator performs unwrapping least squares manner. We call (LSU) estimator. The LSU computed reasonable amount time for data sets moderate size using existing general purpose algorithms...

In this paper, we study rate-compatible puncturing of finite-length low-density parity-check (LDPC) codes. We present a novel scheme that is easy to implement. Our uses the idea degradation in performance reduced by selecting pattern wherein punctured bits are far apart from each other Tanner graph code. Although presented tailored regular codes, it also directly applicable irregular parent ensembles. By simulations, proposed shown be superior existing methods for both and LDPC codes over...

Indoor positioning has attracted a lot of attention in the literature. Positioning systems using existing wireless network have low deployment cost but position error can be up to several meters. Some proposed error; however, they require extra hardware, thereby resulting high costs. In this work, we propose system that offers at cost. The uses visible light communications (VLC) together with accelerometers mobile devices. contrast works on VLC for positioning, our neither requires knowledge...

In this paper, we consider the problem of multiple unicast message delivery in Delay Tolerant Networks (DTNs). Long delays, mobility nodes, and lack connectivity that are characteristics such network make very challenging. Additionally, expiry packets a network, considered useful means regulating resource consumption, reduces reliability increases latency delivery. Traditional approaches to networks was based on transmitting copies entire blocks. Recently, application simple erasure-based...

This work investigates the effect of finite buffer sizes on throughput capacity and packet delay line networks with erasure links that have perfect feedback. These performance measures are shown to be linked stationary distribution an underlying irreducible Markov chain models system exactly. Using simple strategies, bounds derived. The then presents two iterative schemes approximate steady-state node occupancies by decoupling smaller queueing blocks. solutions used understand delay. exact...

We study the index coding problem in presence of an eavesdropper, where aim is to communicate without allowing eavesdropper learn any single message aside from messages it may already know as side information. establish outer bound on underlying secure capacity region problem, which includes polymatroidal and security constraints, well set additional decoding constraints for legitimate receivers. then propose a variant composite scheme, yields inner problem. For achievability coding, secret...

We analyze the problem of strong coordination over a multi-hop line network where node initiating is terminal node. provide characterization capacity region when possesses unlimited local randomness and intermediate nodes operate under functional regime. In this regime, next-hop messages are created only using common previous-hop incoming messages, i.e., at used for generating actions.

The two-envelope problem (or exchange problem) is one of maximizing the payoff in choosing between two values, given an observation only one. This paradigm interest a range fields from engineering to mathematical finance, as it now known that can be increased by exploiting form information asymmetry. Here, we consider version ‘two-envelope game’ where envelopes’ contents are governed continuous positive random variable. While optimal switching strategy and deterministic once envelope has...

General intelligence, the ability to solve arbitrary solvable problems, is supposed by many be artificially constructible. Narrow a given particularly difficult problem, has seen impressive recent development. Notable examples include self-driving cars, Go engines, image classifiers, and translators. Artificial Intelligence (AGI) presents dangers that narrow intelligence does not: if something smarter than us across every domain were indifferent our concerns, it would an existential threat...

In this correspondence, we first investigate some analytical aspects of the recently proposed improved decoding algorithm for low-density parity-check (LDPC) codes over binary erasure channel (BEC). We derive a necessary and sufficient condition to successfully complete when decoder is initialized guess predetermined number guesses after standard message-passing terminates at stopping set. Furthermore, present bounds on bits be guessed successful completion process set encountered. Under...

We investigate the construction of weakly-secure index codes for a sender to send messages multiple receivers with side information in presence an eavesdropper. derive sufficient and necessary condition existence that are secure against eavesdropper access any subset cardinality $t$, fixed $t$. In contrast benefits using random keys network coding, we prove do not promote security three classes index-coding instances.

This paper introduces a novel two-phase broadcast scheme referred to as collaborative rateless (CRBcast). CRBcast is scalable approach for reliable and energy-efficient broadcasting in multihop wireless sensor networks that also addresses load balancing, while requiring no knowledge of network topology. combines the energy-efficiency offered by probabilistic (PBcast) with reliability features application-layer coding. In first phase CRBcast, packets encoded using code are dispersed into...

We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in sense maintaining overall communication rate same channel without constraints. Specifically, we propose and analyze two source-channel coding architectures, which is achieved by multiplexing public confidential messages. In both cases, our main contribution to show that can be compromising requiring only randomness asymptotically vanishing rate. Our first architecture relies on a modified code,...

Consider a mobile network wherein nodes are confined to move and communicate in given area. The is assumed be sparse, direct communication path from source node via multiple hops destination almost never exists. resort storing, carrying, forwarding packets when contact occurs, as means of communication. This paper investigates the question computing throughput capacity resulting network, other words, rate at which can send using relays. It proposes an accurate generalized framework valid for...

The variant of the Heegard-Berger problem where receivers require identical reconstructions is studied, and rate-distortion function for following three settings derived: (a) encoder also required to generate common receivers; (b) side information at are physically degraded; (c) stochastically degraded, source satisfies a particular full-support condition. characterizations indicate that receiver can be fully exploited perform Wyner-Ziv-style binning. However, reconstruction functions depend...

The minimum common randomness required for the approximate and separate generation of a pair correlated discrete memoryless sources is quantified by Wyner's notion information. Recently, Kumar, Li, El Gamal introduced exact information as sources. This new information, which does not have general single-letter characterization, was shown to match symmetric binary erasure source. In this work, we present two conditions on joint statistics under either notions coincide. Though are implicit,...

Single-letter characterisations of the admissible rate regions Gu-Effros two-hop network and Gray-Wyner with side-information are open problems. We show that both problems permit single-letter solutions under assumption causal side-information. In particular, special structure decoder allows one to match converse theorems known coding using standard information-theoretic tools. This observation complements similar results by Maor Merhav for Heegard-Berger problem successive-refinement...

We investigate the problem of reliable and energy-efficient one-to-all broadcasting in multihop wireless networks, propose fractional transmission scheme (FTS) - a low-complexity scalable scheme. FTS exploits nature channels random encoding rateless codes to reduce energy consumption while ensuring delivery packets all nodes network. In proposed scheme, different neighbors node share responsibility transmitting by sending only fraction encoded required successfully receive data sent source....

A linear code equivalence between index coding and network was shown by El Rouayheb et al., which establishes that for any index-coding instance, there exists a network-coding instance can be mapped to suitable code, vice versa. Similarly, an similar constructed. Effros al. extended the include non-linear codes. Subsequently, we secure communication setting in presence of eavesdropper, impose perfect decodability secrecy. In this paper, generalise non-zero decoding error leakage.

We analyze the problem of strong coordination over a multi-hop line network in which node initiating is terminal node. assume that each has access to certain amount randomness local node, and nodes also have shared common randomness, are used together with explicit hop-by-hop communication achieve information-theoretic coordination. derive trade-offs among required rates on links, available at nodes, rate realize present an achievable coding scheme built using multiple layers channel...

Recently, Kumar, Li, and EI Gamal proposed a notion of common information using variation setup used to define Wyner rate. This notion, known as the exact information, is minimum randomness required for separate generation pair correlated discrete memoryless sources. While rate not have single-letter characterization, it was shown equal symmetric binary erasure source in Kumar-Li-EI Gamal-ISIT2014. The authors extended this result establish equality two notions general noisy typewriter, Z -...

Anytime transmission has been shown to be an effective means of stabilizing unstable system over noisy channels. A crucial issue in implementing anytime strategies is the design codes that offer good finite-length performance and asymptotic properties. This paper introduces efficient code derived from protograph-based low-density parity-check convolutional known as extended S-LDPCC (XS-LDPCC) codes. The properties XS-LDPCC both binary erasure channel (BEC) binary-input additive white...