Alice and Bob are connected via a two-way binary channel. This paper describes an algorithm to enable Alice to send a message to Bob when 1) an oblivious adversary flips an unknown number of bits, T , on the channel; and 2) the message length L, and a desired error probability, ǫ are public knowledge. With probability at least 1− ǫ, our algorithm ensures that Bob receives the correct message, a...

Effective Communication for marketing is a vital field in business organizations, which is used to convey the details about their products and services to the market segments and subsequently to build long lasting customer relationships. This paper focuses on an emerging component of the integrated marketing communication, ie. social media networking, as it is increasingly becoming the trend. I...

The collaborative nature of communication has been demonstrated by research on the increased efficiency (Hupet & Chantraine, 1992) and the adaptive behavior (Giles, Mulac, Bradac, & Johnson, 1987) of interacting pairs, but these two lines of research have never been explicitly related. This paper reports empirical results showing that adaptively matching word use can increase communication effi...

7] A. Orlitsky. Worst-case interactive communication II: Two messages are not optimal. 11] H. Witsenhausen. The zero-error side information problem and chromatic numbers. 14] J. Friedman. Constructing o(n log n) size monotone formula for the kth threshold function on n variables. A m be determined for m 3? For one-way amortized complexity, let (k) be the chromatic number of G (k) , then ^ A 1 =...

We describe an integrated modeling framework for an interactive power network (IPN) consisting of a power network (PN) and a wireless communication network (WCN). The PN is modeled using a set of piecewise-linear (PWL) equations. The WCN is modeled using a Markov-chain based model that can capture the randomness of the communication channel. The impacts of the WCN are incorporated into the PN m...

In this paper we present the communication protocol that we use to implement rst class channels. Ordinary channels allow data communication (like CSP/Occam); rst class channels allow communicating channel ends over a channel. This enables processes to exchange communication capabilities, making the communication graph highly exible. In this paper we present a simple protocol to communicate chan...

We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap advantages for communication. For an arbitrary protocol with n messages, designed noiseless qudit channel poly (n ) size alphabet, our main result is simulation method that fails probability less than 2 <sup xmlns:mml="http://www.w3.org/1998/Math...

In this paper we focus on estimating the amount of information that can be embedded in the sequencing of packets in ordered channels. Ordered channels, e.g. TCP, rely on sequence numbers to recover from packet loss and packet reordering. We propose a formal model for transmitting information by packet-reordering. We present natural and well-motivated channel models and jamming models including ...

We consider the random multiple access of a slotted broadcast communication channel. Packet arrivals for such channels are often modeled as Poisson processes because the latter have attractive theoretical properties and are well understood, even though a number of traac studies have shown that packet interarrival times are not always exponentially distributed. For example, recent studies argue ...

Let the input to a computation problem be split between two processors connected by a communication link; and let an interactive protocol T be known by which, on any input, the processors can solve the problem using no more than T transmissions of bits between them, provided the channel is noiseless in each direction. We study the following question: If in fact the channel is noisy, what is the...