The following pages link to (Q4156696):
Displaying 50 items.
- Comparison of the normalized Jensen functionals of two convex functions with applications (Q279956) (← links)
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- Asymptotics of the upper matching conjecture (Q385029) (← links)
- \(H\)-colouring bipartite graphs (Q414646) (← links)
- An inequality for logarithmic mapping and applications for the Shannon entropy (Q597257) (← links)
- Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
- \(H\)-coloring tori (Q713976) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Union-free hypergraphs and probability theory (Q798335) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- A hybrid EM approach to spatial clustering (Q959220) (← links)
- State space realizations and monomial equivalence for convolutional codes (Q998191) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Repeated games with stationary bounded recall strategies (Q1108212) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- New bounds for perfect hashing via information theory (Q1122979) (← links)
- Some results on ordering of survival functions through uncertainty (Q1126098) (← links)
- GAS, a concept on modeling species in genetic algorithms (Q1128609) (← links)
- Planes of order 10 do not have a collineation of order 5 (Q1143397) (← links)
- A cryptosystem for multiple communication (Q1145121) (← links)
- Uncertainty in physiology and physics (Q1146625) (← links)
- Codes and designs (Q1159672) (← links)
- Best Huffman trees (Q1160111) (← links)
- Intersections of k-element sets (Q1166522) (← links)
- A combinatorial problem for vector spaces over finite fields (Q1185082) (← links)
- Coding Markov chains from the past (Q1196317) (← links)
- How to avoid the cheaters succeeding in the key sharing scheme (Q1261009) (← links)
- Generalized rank functions and an entropy argument (Q1304635) (← links)
- Two new decoding algorithms for Reed-Solomon codes (Q1311609) (← links)
- On the commutativity of discrete memoryless channels in cascade (Q1338651) (← links)
- An information-theoretic approach to the design of a distributed cascade of sensors (Q1358709) (← links)
- Entropy of sums of random digits (Q1361542) (← links)
- Some bounds on entropy measures in information theory (Q1372258) (← links)
- On viewing block codes as finite automata. (Q1401192) (← links)
- Some upper bounds for relative entropy and applications (Q1569990) (← links)
- Attainable results in committee elections. (Q1596956) (← links)
- Boltzmann-Shannon entropy and the double-slit experiment (Q1619866) (← links)
- On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\) (Q1633279) (← links)
- Quantum mechanics over sets: a pedagogical model with non-commutative finite probability theory as its quantum probability calculus (Q1708956) (← links)
- Of bits and wows: a Bayesian theory of surprise with applications to attention (Q1784575) (← links)
- A counterpart of Jensen's discrete inequality for differentiable convex mappings and applications in information theory (Q1816630) (← links)
- Dynamics of defects in the vector complex Ginzburg-Landau equation (Q1851381) (← links)
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (Q1894579) (← links)
- Complex-valued autoencoders (Q1941595) (← links)
- Shannon type inequalities via time scales theory (Q2058189) (← links)
- On information gain, Kullback-Leibler divergence, entropy production and the involution kernel (Q2144305) (← links)
- The number of 4-colorings of the Hamming cube (Q2182043) (← links)
- Stability for maximal independent sets (Q2309229) (← links)
- Counting maximal antichains and independent sets (Q2376906) (← links)
- Majorization, Csiszár divergence and Zipf-Mandelbrot law (Q2400774) (← links)
