The following pages link to Toby Berger (Q580815):
Displaying 50 items.
- A decomposition theorem for binary Markov random fields (Q580816) (← links)
- (Q1083423) (redirect page) (← links)
- Improved upper bound for the capacity of the random-access channel (Q1083424) (← links)
- Asymptotic component densities in programmable gate arrays realizing all circuits of a given size (Q1206434) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- (Q2741447) (← links)
- Energy Efficient Neurons With Generalized Inverse Gaussian Conditional and Marginal Hitting Times (Q2977348) (← links)
- Optimum '1'-ended binary prefix codes (Q3199322) (← links)
- Poisson multiple-access contention with binary feedback (Q3216553) (← links)
- Minimum breakdown degradation in binary source encoding (Q3328442) (← links)
- Capacity and zero-error capacity of Ising channels (Q3481636) (← links)
- epsilon -entropy and critical distortion of random fields (Q3487269) (← links)
- The Capacity of Finite-State Markov Channels With Feedback (Q3546690) (← links)
- Zero-error instantaneous coding of correlated sources with length constraints is NP-complete (Q3547831) (← links)
- Multiple Description Quantization Via Gram–Schmidt Orthogonalization (Q3548023) (← links)
- On Successive Refinement of the Binary Symmetric Markov Source (Q3548064) (← links)
- Successive Coding in Multiuser Information Theory (Q3548901) (← links)
- Successive Wyner–Ziv Coding Scheme and Its Application to the Quadratic Gaussian CEO Problem (Q3604510) (← links)
- Robust Distributed Source Coding (Q3604775) (← links)
- Delay analysis of interval-searching contention resolution algorithms (Q3676040) (← links)
- (Q3699596) (← links)
- On critical distortion for Markov sources (Corresp.) (Q3708695) (← links)
- Rate distortion when side information may be absent (Q3712235) (← links)
- New outer bounds to capacity regions of two-way channels (Q3726001) (← links)
- Delay Analysis of 0.487 Contention Resolution Algorithms (Q3751500) (← links)
- New results in binary multiple descriptions (Q3768802) (← links)
- Some families of zero- error block codes for the two-user binary adder channel with feedback (Q3778667) (← links)
- Information theory in random fields (Q3797087) (← links)
- (Q3797104) (← links)
- Estimation via compressed information (Q3798581) (← links)
- (Q3827335) (← links)
- Multiterminal source encoding with one distortion criterion (Q3829470) (← links)
- Multiterminal source encoding with encoder breakdown (Q3829471) (← links)
- An upper bound on the rate distortion function for source coding with partial side information at the decoder (Q3864405) (← links)
- Rate-distortion for correlated sources with partially separated encoders (Q3956848) (← links)
- Entropic aspects of random fields on trees (Q3986468) (← links)
- A new method to estimate the critical distortion of random fields (Q3991401) (← links)
- (Q4025083) (← links)
- Tree encoding of Gaussian sources (Q4055529) (← links)
- Information-singular random processes (Q4070740) (← links)
- (Q4091823) (← links)
- Complete decoding of triple-error-correcting binary BCH codes (Q4096856) (← links)
- Capacity and a lower bound to<tex>R_{mbox{comp}}</tex>for a channel with symbol fission (Q4119097) (← links)
- Explicit bounds to R(D) for a binary symmetric Markov source (Q4132124) (← links)
- On binary sliding block codes (Q4135382) (← links)
- Coding for noisy channels with input-dependent insertions (Q4141097) (← links)
- (Q4220558) (← links)
- (Q4221662) (← links)
- (Q4294503) (← links)
- Failure of successive refinement for symmetric Gaussian mixtures (Q4336325) (← links)
