IEEE TRANSACTIONS ON INFORMATION THEORY

By A. G. Oettinger. 1998

Since at most T of these equations can come from (7), at least (m T) of them come from (8’). Thus, for the distribution (PI’, . . . , p,‘), at most T of the probabilities are nonzero. The proof of our contention now follows by letting plo, . . . , 10~0 in the above argument be a distribution for which channel capacity is attained. It should be remarked that this proof provides (via the Simplex Method of linear programming) a means for reducing any transmitter with more than r symbols, to another, equally good or better, with at most T symbols. For a discussion of the possibility of reducing the number of receiver symbols, see Feinstein.5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Visualisation and 'diagnostic classifiers' reveal how recurrent and recursive neural networks process hierarchical structure (2017, neutral): “Such hierarchical structures can be well represented by symbolic models [Chomsky, 1956; Montague, 1970], but if and how they can be represented by artificial neural models is an open question.”
ReInForM: reliable information forwarding using multiple paths in sensor networks (2003, background): “Since the graph is assumed to be connected, there is at least one node in setH s .”
Entropic uncertainty relations—a survey (2009, methodology): “Using the SDP formalism of (Ballester et al. , 2008) it is easily seen (Wehner et al. , 2008) that this gives us In the limit of large n , it is known that for independent states, the min-entropy behaves approximately like the Shannon entropy (Renner, 2005; Tomamichel et al. , 2008).”
Random projection trees and low dimensional manifolds (2008, methodology): “Finally, we complete the proof of Theorem 3.”
Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement (v1.0) (2016, unknown): “LSH is designed for finding points within a fixed radius of the query point, i.e., radius search.”
The security of practical quantum key distribution (2008, background): “…Gisin and Renner, 2005), more complex pre-processing up to 12.9% (Smith, Renes and Smolin, 2008); two-way postprocessing can increase it significantly further, at least up to 20.0%, but at the expenses of drastically reduced key rate (Bae and Aćın, 2007; Chau, 2002; Gottesman and Lo, 2003).”