The following pages link to (Q5595624):
Displaying 50 items.
- Using information theory approach to randomness testing (Q110728) (← links)
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes (Q259876) (← links)
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (Q268457) (← links)
- Quasi-perfect linear codes from planar and APN functions (Q269565) (← links)
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions (Q287037) (← links)
- Infomax strategies for an optimal balance between exploration and exploitation (Q310029) (← links)
- A method for recognizing and evaluating states of weakly formalized dynamic object based on labeling a time series (Q353691) (← links)
- Metabolic cost of neuronal information in an empirical stimulus-response model (Q353894) (← links)
- Min-entropy as a resource (Q385717) (← links)
- The effect of interspike interval statistics on the information gain under the rate coding hypothesis (Q395709) (← links)
- Efficient prediction algorithms for binary decomposition techniques (Q408680) (← links)
- Error exponents for two-hop Gaussian multiple source-destination relay channels (Q439735) (← links)
- Disturbance rejection with information constraints: Performance limitations of a scalar system for bounded and Gaussian disturbances (Q445138) (← links)
- Mutual information and redundancy for categorical data (Q451475) (← links)
- Masking property of quantum random cipher with phase mask encryption (Q479443) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Multiuser cognitive radio networks: an information-theoretic perspective (Q531114) (← links)
- Adaptive estimation for Hawkes processes; application to genome analysis (Q605927) (← links)
- On the physical implementation of logical transformations: generalized \(L\)-machines (Q606983) (← links)
- Augmented second-order statistics of quaternion random signals (Q612577) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- Comment on: ``Exposed-key weakness of \(\alpha \eta \)'' [Phys. Lett. A 370 (2007) 131] (Q646974) (← links)
- Message-passing algorithms for inference and optimization (Q658470) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Characteristic inequalities for binary trees (Q674183) (← links)
- Rational maps and maximum likelihood decodings (Q692031) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Universal codes as a basis for time series testing (Q713722) (← links)
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy (Q742865) (← links)
- A note on rational inattention and rate distortion theory (Q777920) (← links)
- New upper bounds in the hypothesis testing problem with information constraints (Q784381) (← links)
- Capacity of dimension-limited channels (Q803104) (← links)
- Generalized rule for the addition of entropies for underdetermined data (Q845135) (← links)
- On coding of underdetermined sequences with a fidelity criterion (Q845514) (← links)
- Bounds for \(f\)-divergences under likelihood ratio constraints. (Q851578) (← links)
- Denoising by sparse approximation: error bounds based on rate-distortion theory (Q871470) (← links)
- Analytic solutions for three taxon ML trees with variable rates across sites (Q876473) (← links)
- On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels (Q911544) (← links)
- Extracting state information from a quantized output record (Q912038) (← links)
- A binary decision algorithm (Q917292) (← links)
- Reconstructing attractors from scalar time series: A comparison of singular system and redundancy criteria (Q922471) (← links)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- State estimation via limited capacity noisy communication channels (Q926289) (← links)
- On-off frequency-shift keying for wideband fading channels (Q933908) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
