scientific article; zbMATH DE number 3586931
From MaRDI portal
Publication:4156696
zbMath0376.94011MaRDI QIDQ4156696
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
Boltzmann-Shannon entropy and the double-slit experiment, Comparison of the normalized Jensen functionals of two convex functions with applications, On the commutativity of discrete memoryless channels in cascade, On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\), Counting maximal antichains and independent sets, On regular 3-wise intersecting families, The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain, On information gain, Kullback-Leibler divergence, entropy production and the involution kernel, An information-theoretic approach to the design of a distributed cascade of sensors, Entropy of sums of random digits, Repeated games with stationary bounded recall strategies, Some intersection theorems for ordered sets and graphs, Fredman–Komlós bounds and information theory, Simple algorithms for decoding systematic Reed-Solomon codes, Some bounds on entropy measures in information theory, Majorization, Csiszár divergence and Zipf-Mandelbrot law, An inequality for logarithmic mapping and applications for the Shannon entropy, New bounds for perfect hashing via information theory, Some results on ordering of survival functions through uncertainty, GAS, a concept on modeling species in genetic algorithms, Asymptotics of the upper matching conjecture, The number of 4-colorings of the Hamming cube, Simple proof of security of the multiparty prepare and measure QKD, Planes of order 10 do not have a collineation of order 5, On viewing block codes as finite automata., A cryptosystem for multiple communication, \(H\)-colouring bipartite graphs, Uncertainty in physiology and physics, Complex-valued autoencoders, Some decoding applications of minimal realization, Good codes based on very sparse matrices, Authentication codes: An area where coding and cryptology meet, Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m ), Codes and designs, Quantum mechanics over sets: a pedagogical model with non-commutative finite probability theory as its quantum probability calculus, Best Huffman trees, Intersections of k-element sets, Trees with exponentially growing costs, A combinatorial problem for vector spaces over finite fields, Coding Markov chains from the past, Computing Logarithms in Finite Fields of Characteristic Two, A hybrid EM approach to spatial clustering, Boolean autoencoders and hypercube clustering complexity, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, \(H\)-coloring tori, Range of cube-indexed random walk, On output independence and complementariness in rank-based multiple classifier decision systems, Of bits and wows: a Bayesian theory of surprise with applications to attention, Higher-order terms in asymptotic expansion for information loss in quantized random processes, State space realizations and monomial equivalence for convolutional codes, Semantic security for the McEliece cryptosystem without random oracles, How to avoid the cheaters succeeding in the key sharing scheme, Shannon type inequalities via time scales theory, A counterpart of Jensen's discrete inequality for differentiable convex mappings and applications in information theory, Stability for maximal independent sets, Some upper bounds for relative entropy and applications, Unnamed Item, Computer algebra tales on Goppa codes and McEliece cryptography, Oblivious Transfer Based on the McEliece Assumptions, Generalized rank functions and an entropy argument, Dynamics of defects in the vector complex Ginzburg-Landau equation, Union-free hypergraphs and probability theory, Attainable results in committee elections., Two new decoding algorithms for Reed-Solomon codes
