scientific article; zbMATH DE number 3316587
From MaRDI portal
zbMath0198.52201MaRDI QIDQ5595624
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Communication, information (94Axx)
Related Items
Space-time tradeoffs for linear recursion, Almost cover-free codes, Unnamed Item, Foundations of compositional model theory, Belief propagation and loop series on planar graphs, Loop series for discrete statistical models on graphs, Multiparty multicast schemes for remote state preparation of complex coefficient quantum states via partially entangled channels, The pruning-grafting lattice of binary trees, Unnamed Item, On the information rate of perfect secret sharing schemes, Achieving the Holevo bound via a bisection decoding protocol, Linear codes interpolation from noisy patterns by means of a vector quantization process, Models of multi-user write-efficient memories and general diametric theorems, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Statistically varyingN-person games with incomplete information, Coarse-grained entropy rates for characterization of complex time series, Unnamed Item, Evaluation of statistical relationship of random variables via mutual information, A unified definition of mutual information with applications in machine learning, Nested linear/lattice codes revisited, Cases in which ancestral maximum likelihood will be confusingly misleading, Moderate deviation analysis for classical communication over quantum channels, A NEW DIRECTED DIVERGENCE MEASURE AND ITS CHARACTERIZATION∗, Unnamed Item, On non-additive measures of inaccuracy, Hybrid statistical estimation of mutual information and its application to information flow, Binary search and recursive graph problems, Quantum limits on the entropy of bandlimited radiation, Unsupervised Classifier Based on Heuristic Optimization and Maximum Entropy Principle, Relative information functions and their type (\(\alpha, \beta\)) generalizations, The Augustin capacity and center, Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields, On the non-abelian group code capacity of memoryless channels, Decoherence of a two-level system in a coherent superposition of two dephasing environments, Relaxation process of a two-level system in a coherent superposition of two environments, Entropy modeling of network structures, Using ideas of Kolmogorov complexity for studying biological texts, On the optimality of a simple prefix code, A Bernstein-von Mises theorem for discrete probability distributions, Uniform-in-bandwidth consistency for kernel-type estimators of Shannon's entropy, The sphere packing bound for memoryless channels, The capacities of certain special channels with arbitrarily varying channel probability functions, Active sequential hypothesis testing, Pointwise comparison of PCM and \(\Sigma \Delta \) quantization, Shannon optimal priors on independent identically distributed statistical experiments converge weakly to Jeffrey's prior, Recursive constructions for perfect secret sharing schemes, Communication waveform properties of an exact folded-band chaotic oscillator, A confidence-set approach to signal denoising, Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form, Quantum Gaussian memory channels, Sequential syntactical decoding, Multiple Differential Cryptanalysis: Theory and Practice, Unnamed Item, Capacity of discrete time Gaussian channel with and without feedback, II, Error exponents for Nakagami-\(m\) fading channels, ENTROPY OF ORDER α AND TYPE β AND SHANNON'S INEQUALITY, Paraconsistent informational logic, Conditions equivalent and doubly equivalent to consistency of approximate MLE's, A portable MIMO testbed and selected channel measurements, Unnamed Item, Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series, Universal codes as a basis for nonparametric testing of serial independence for time series, Unique decipherability in formal languages, On the number of factorizations of polynomials over finite fields, A Jamming Game in Wireless Networks with Transmission Cost, On the Foundations of Quantitative Information Flow, Coordinate invariance as a fundamental constraint on the form of stimulus-specific information measures, Tradeoff relation between mutual information and error probability in data classification problem, Nonequilibrium in thermodynamic formalism: the second law, gases and information geometry, Information geometry of reversible Markov chains, Independent unbiased coin flips from a correlated biased source - a finite state Markov chain, On the computational tractability of statistical estimation on amenable graphs, Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata), An approach to artificial nonsymbolic cognition, New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels, Chaos, bifurcations and strange attractors in environmental radioactivity dynamics of some geosystems, Nonlinear dynamics of atomic and molecular systems in an electromagnetic field: deterministic chaos and strange attractors, A class of measures of informativity of observation channels, New Entropy Estimator with an Application to Test of Normality, Certain infinite Markov chains and sequential decoding, Bounds on the weighted path length of binary trees, On the concept of relative information, Nonadditive entropies of order 1 and type beta and of order alpha and type beta; cascaded channels and the equivocation inequality, Estimation of distribution density, The Capacity of the White Gaussian Noise Channel, Large deviations of convex polyominoes, Optimal transmission of a Gaussian vector through a Gaussian-white-noise vector channel with feedback, Unnamed Item, Searching and encoding for infinite ordered sets, Buyer feedback as a filtering mechanism for reputable sellers, On asymptotically optimal methods of prediction and adaptive coding for Markov sources, Information theoretic models in language evolution, Unnamed Item, Universal coding for memoryless sources with countably infinite alphabets, Properties of noncommutative Rényi and Augustin information, On the reducibility of alphabets for problems of underdetermined data coding, Low-rank multi-parametric covariance identification, Second-order asymptotics for the classical capacity of image-additive quantum channels, Error exponents for multi-keyhole MIMO channels, The Vernam cipher is robust to small deviations from randomness, Optical switch dimensioning and the classical occupancy problem, Decision tree design by simulated annealing, A Fermatean Fuzzy ELECTRE Method for Multi-Criteria Group Decision-Making, Common, Correlated, and Private Information in Control of Decentralized Systems, On Shannon’s Duality of a Source and a Channel and Nonanticipative Communication and Communication for Control, A FEW REMARKS ON MEASURES OF UNCERTAINTY IN DEMPSTER-SHAFER THEORY1, A new proof of a result concerning computation of the capacity for a discrete channel, On the Classical Capacity of a Channel with Stationary Quantum Gaussian Noise, Unbounded search and recursive graph problems, Influence of Dzyaloshinskii-Moriya and Kaplan-Shekhtman-Entin-Wohlman-Aharony interactions on quantum entanglement in a two-qubit Heisenberg XYZ chain, Unnamed Item, Unnamed Item, Probabilistic Amplitude Shaping, On the reliability function for a BSC with noiseless feedback at zero rate, Some estimations of the Jensen difference and applications, Optimal Control and Signaling Strategies of Control-Coding Capacity of General Decision Models: Applications to Gaussian Models and Decentralized Strategies, Efficient generation of binary words of given weight, Hypercontractivity of Spherical Averages in Hamming Space, Nearly optimal perfectly periodic schedules, On generalized measures of relative information and inaccuracy, ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING, THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES, Lower time bounds for randomized computation, Some properties of Lin–Wong divergence on the past lifetime data, Lower Bound on the Error Probability for Families with Bounded Likelihood Ratios, Search for Sparse Active Inputs: A Review, Wringing out better Bell inequalities, Distribution of mutual information, Quantifying information flow in cryptographic systems, Error exponents for quantum channels with constrained inputs, Detection and recognition of a binary linear code, Bounds on the rate-distortion function for geometric measure of distortion, Information-theoretic comparisons of cellular multiple-access systems with bandwidth-dependent fading considerations, Optimal encoding of non-stationary sources, Superimposed codes for the search model of a. renyi, Elimination of correlation in random codes for arbitrarily varying channels, Multiset and set decipherable codes, Unnamed Item, Optimal MAV operations in an uncertain environment, Differentiating between good credits and bad credits using neuro-fuzzy systems, Ergodic Control-Coding Capacity of Stochastic Control Systems: Information Signalling and Hierarchical Optimality of Gaussian Systems, A simple derivation of the refined sphere packing bound under certain symmetry hypotheses, Unnamed Item, Informational logic for automated reasoning, Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements, Around the variational principle for metric mean dimension, Coding and Capacity Calculation for the $\mathcal{T}$ -User F-Adder Channel, Replica analysis of overfitting in generalized linear regression models, Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\), Quasi-perfect linear codes from planar and APN functions, Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions, The relation between information theory and the differential geometry approach to statistics, Generating quasi-random sequences from semi-random sources, Testing for nonlinearity using redundancies: Quantitative and qualitative aspects, The role of duality in optimization problems involving entropy functionals with applications to information theory, Infomax strategies for an optimal balance between exploration and exploitation, Density-free convergence properties of various estimators of entropy, Generalized rule for the addition of entropies for underdetermined data, On coding of underdetermined sequences with a fidelity criterion, Restricted exponential forgetting in real-time identification, Controlling individual information in statistics by coding, A note on dynamic threshold schemes, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Extension of some results for channel capacity using a generalized information measure, On variable length coding with side information for discrete memoryless sources, Bounds for \(f\)-divergences under likelihood ratio constraints., Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources, Communication games with partially soft power constraints, Games with informants. An information-theoretical approach towards a game-theoretical problem, A method for recognizing and evaluating states of weakly formalized dynamic object based on labeling a time series, Metabolic cost of neuronal information in an empirical stimulus-response model, A unified framework for connectionist systems, Denoising by sparse approximation: error bounds based on rate-distortion theory, Analytic solutions for three taxon ML trees with variable rates across sites, Adaptive estimation for Hawkes processes; application to genome analysis, On the physical implementation of logical transformations: generalized \(L\)-machines, Min-entropy as a resource, Augmented second-order statistics of quaternion random signals, The effect of interspike interval statistics on the information gain under the rate coding hypothesis, Angular synchronization by eigenvectors and semidefinite programming, On metrics matched to the discrete memoryless channel, Efficient prediction algorithms for binary decomposition techniques, Inferences concerning interpersonal choices given anonymously, Source coding theorem and its converse with side information, Multiple-user communication, Linear prediction, filtering, and smoothing: An information-theoretic approach, An approximation algorithm for binary searching in trees, Error exponents for two-hop Gaussian multiple source-destination relay channels, Representation of graphs, On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels, Extracting state information from a quantized output record, Disturbance rejection with information constraints: Performance limitations of a scalar system for bounded and Gaussian disturbances, A binary decision algorithm, Mutual information and redundancy for categorical data, Comment on: ``Exposed-key weakness of \(\alpha \eta \) [Phys. Lett. A 370 (2007) 131], Reconstructing attractors from scalar time series: A comparison of singular system and redundancy criteria, On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case, On the height of digital trees and related problems, State estimation via limited capacity noisy communication channels, Message-passing algorithms for inference and optimization, An information theory of image gathering, Certainty equivalents and information measures: Duality and extremal principles, Masking property of quantum random cipher with phase mask encryption, On-off frequency-shift keying for wideband fading channels, An iterative method for computing the performance of discrete memoryless communication channels, Singular-value decomposition in attractor reconstruction: Pitfalls and precautions, Composition of semi-LTCs by two-wise tensor products, Fully dynamic secret sharing schemes, On the information rate of secret sharing schemes, Characteristic inequalities for binary trees, Coding for a multiple access OR channel: A survey, Multiple packing in sum-type metric spaces, Inductive reasoning and Kolmogorov complexity, Measures of uncertainty and information in computation, Application of information-theoretic tests for the analysis of DNA sequences based on Markov chain models, Rational maps and maximum likelihood decodings, Multiuser cognitive radio networks: an information-theoretic perspective, Towards lower bounds on locally testable codes via density arguments, Asymptotic component densities in programmable gate arrays realizing all circuits of a given size, Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others, At the dawn of the theory of codes, Minimax estimation with divergence loss function, Minimum times and memories needed to compute the values of a function, Cone-bounded nonlinearities and mean-square bounds - smoothing and prediction, Universal codes as a basis for time series testing, An almost optimal algorithm for unbounded searching, Using information theory approach to randomness testing, Binary trees with choosable edge lengths, Capacity region of degraded broadcast channels with feedback, Cascaded channels and the equivocation inequality, An application of information theory to the problem of statistical disclosure, The separating property of random matrices, Degrees of conditional (in)dependence: A framework for approximate Bayesian networks and examples related to the rough set-based feature selection, Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy, Capacity of mismatched Gaussian channels with and without feedback, General information dispersal algorithms, Efficient \(m\)-ary balanced codes, A note on rational inattention and rate distortion theory, New upper bounds in the hypothesis testing problem with information constraints, Communication complexity and combinatorial lattice theory, On the size of shares for secret sharing schemes, Capacity of dimension-limited channels, \(M\)-matrices and bounds for reliable transmission of information in communication systems and economic markets, Universal retrieval trees, Trigonometric entropies, Jensen difference divergence measures, and error bounds, Special algorithms for convolutions over Galois fields, Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes, Almost disjunctive list-decoding codes
