We prove new inner bounds for several multiterminal channels with classical inputs and quantum outputs. Our are all proved in the one-shot setting natural analogues of best respective channels. For some these channels, similar were unknown even asymptotic independent identically distributed setting. our by appealing to a classical–quantum joint typicality lemma established companion paper. This...

Three cued-recall experiments examined the effect of category typicality on the ordering of words in sentence production. Past research has found that typical items tend to be mentioned before atypical items in a phrase--a pattern usually associated with lexical variables (like word frequency), and yet typicality is a conceptual variable. Experiment 1 revealed that an appropriate conceptual fra...

Typicality is routinely invoked in everyday contexts: bobcats are typically short-tailed; people less than seven feet tall. scientific contexts as well: typical gases expand; quantum systems exhibit probabilistic behaviour. And typicality facts like these support many explanations, both quotidian and scientific. But what it for something to be typical? how do explain? In this paper, I propose a...

We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense t...

We consider a wireless sensors network scenario where two nodes detect correlated sources and deliver them to a central collector via a wireless link. Differently from the Slepian-Wolf approach to distributed source coding, in the proposed scenario the sensing nodes do not perform any precompression of the sensed data. Original data are instead independently encoded by means of low-complexity c...

In this paper, a Joint Source Channel coding scheme based on LDPC codes is investigated. We consider two concatenated LDPC codes, one allows to compress a correlated source and the second to protect it against channel degradations. The original information can be reconstructed at the receiver by a joint decoder, where the source decoder and the channel decoder run in parallel by transferring ex...

Concept representation in ontology is a basic problem on the Semantic Web. In human cognitive process, object typicality plays an important role in concept representation. Traditional ontologies cannot reflect the typicality of objects in concepts. In this paper, we present a cognitive model of ontology with multi-prototype concept and object typicality. It can better approximate to human’s cog...

A new linear block precoding technique is combined with error-correction coding for wireless orthogonal frequencydivision multiplexing (OFDM) transmissions through frequency-selective fading channels. Our precoder is based on the maximization of the mean cutoff rate and requires only the knowledge of the average relative channel multipath gains and delays at the transmitter. Convolutional codin...

The Asymptotic Equipartition Property (AEP) in information theory is the analog of the Law of Large Numbers in probability theory. Assume that the binary random variable X has a probability mass function defined by p(1) = 2/3, and p(0) = 1/3, where X1,X2,...,Xn are i.i.d. random variables according to p(x), and we want to observe a realization of the sequenceX1,X2,...,Xn, where n −→ ∞. We will ...

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...