The following pages link to Haim Permuter (Q2369597):
Displaying 50 items.
- A study of Gaussian mixture models of color and texture features for image classification and segmentation (Q2369599) (← links)
- Arbitrarily Varying Wiretap Channels With Type Constrained States (Q2976444) (← links)
- Multicoding Schemes for Interference Channels (Q2976620) (← links)
- Semantic-Security Capacity for Wiretap Channels of Type II (Q2976696) (← links)
- Duality of a Source Coding Problem and the Semi-Deterministic Broadcast Channel With Rate-Limited Cooperation (Q2976824) (← links)
- On State-Dependent Degraded Broadcast Channels With Cooperation (Q2976826) (← links)
- Cooperative Binning for Semideterministic Channels (Q2976958) (← links)
- Multiple Access Channels With Combined Cooperation and Partial Cribbing (Q2977007) (← links)
- The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint (Q2977030) (← links)
- MAC With Action-Dependent State Information at One Encoder (Q2978815) (← links)
- Strong Secrecy for Cooperative Broadcast Channels (Q2979116) (← links)
- Information Embedding on Actions (Q2983331) (← links)
- Capacity of a POST Channel With and Without Feedback (Q2986088) (← links)
- The Finite State MAC With Cooperative Encoders and Delayed CSI (Q2986097) (← links)
- Capacity and Coding for the Ising Channel With Feedback (Q2986134) (← links)
- To Feed or Not to Feedback (Q2986135) (← links)
- Source Coding When the Side Information May Be Delayed (Q2989195) (← links)
- Multiple-Access Channel With Partial and Controlled Cribbing Encoders (Q2989315) (← links)
- Directed Information, Causal Estimation, and Communication in Continuous Time (Q2989342) (← links)
- Computable Bounds for Rate Distortion With Feed Forward for Stationary and Ergodic Sources (Q2989395) (← links)
- Extension of the Blahut–Arimoto Algorithm for Maximizing Directed Information (Q2989454) (← links)
- Lossless Coding of Correlated Sources With Actions (Q2989654) (← links)
- Analogy between gambling and measurement-based work extraction (Q3302625) (← links)
- Capacity of the Trapdoor Channel With Feedback (Q3604464) (← links)
- Parametric estimation of the orientation of textured planar surfaces (Q4419877) (← links)
- Estimating the orientation of planar surfaces: algorithms and bounds (Q4545797) (← links)
- A Communication Channel With Random Battery Recharges (Q4566617) (← links)
- Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint (Q4682814) (← links)
- Initialization Algorithms for Convolutional Network Coding (Q4682837) (← links)
- Computable Upper Bounds on the Capacity of Finite-State Channels (Q4958258) (← links)
- Finite State Channels With Time-Invariant Deterministic Feedback (Q4975726) (← links)
- Capacity Region of the Finite-State Multiple-Access Channel With and Without Feedback (Q4975871) (← links)
- Feedback Capacity of the Compound Channel (Q4975960) (← links)
- The Secrecy Capacity of Cost-Constrained Wiretap Channels (Q5003666) (← links)
- Feedback Capacity of Ising Channels With Large Alphabet via Reinforcement Learning (Q5039972) (← links)
- The Feedback Capacity of Noisy Output Is the STate (NOST) Channels (Q5096970) (← links)
- Wiretap Channels With Random States Non-Causally Available at the Encoder (Q5123801) (← links)
- Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information (Q5211447) (← links)
- MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages (Q5223947) (← links)
- Feedback Capacity and Coding for the $(0,k)$ -RLL Input-Constrained BEC (Q5224058) (← links)
- Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications (Q5224125) (← links)
- Cascade and Triangular Source Coding With Side Information at the First Two Nodes (Q5271873) (← links)
- Capacity Region of Finite State Multiple-Access Channels With Delayed State Information at the Transmitters (Q5271883) (← links)
- Cascade, Triangular, and Two-Way Source Coding With Degraded Side Information at the Second User (Q5272159) (← links)
- Probing Capacity (Q5272236) (← links)
- Message and State Cooperation in Multiple Access Channels (Q5272269) (← links)
- Source Coding With a Side Information “Vending Machine” (Q5273551) (← links)
- Interpretations of Directed Information in Portfolio Theory, Data Compression, and Hypothesis Testing (Q5273587) (← links)
- Capacity of Remotely Powered Communication (Q5280837) (← links)
- A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels (Q5280838) (← links)
