Welcome To

Haim Permuter's Homepage

Teaching             Reseach Interstets          Publication          Links          Bio   

Haim's photo

Ben Gurion University
Electrical & Computer Engineering Department

P.O.B 653 Beer-Sheva 84105, Israel. 

Fax:     972-8-6472949
Phone :972-8-6461558
Email: haimp (at) bgu (dot) ac (dot) il

Office: 312  in Building 33
Office hours: Monday 3-4pm.

Research Interests

Information theory, wireless communication systems, physical layer security, cognitive radio, network coding, channel with side information, coordination and source coding, Markov decision processes, optimization, statistical signal processing, Physical layer security. 

Basic course:
Introduction to information and coding theory (361-1-3761)  will be taught in the 2nd semester of  2015/16.
Machine Learning:  Deep Learning  suervised/unsupervised/reinforcement learning, MAP, ML, KNN, Neural Networks, Back-propagation, regulaziation, dropout, aouto encoder, RBM, CNN, RNN

Advanced course:

Multi-User Information Theory  2009 : Entropy of Markov processes, Gambling,  Feedback, MAC,  States (compound, causal, non causal)
Multi-User Information Theory  2010 : Methods of types, Rate distorstion, Coordination, Broadcast, Relay
Multi-User Information Theory  2011 : Methods of types, Relay, convex optimization
Multi-User Information Theory  2013 : Methods of types, Broadcast, degraded message set, Slepien-Wolf, Intereference channel
Multi-User Information Theory  2015 : Methods of types, Rate distorstion, TBD

Students who are intersted in communication or in the combintion of math and engineering are welcome to contact me for research position. 

Selected Publications

Cooperative communication
H. Permuter,  S. Shamai, and A. Somekh-Baruch,   “Message and state cooperation in multiple access channels,” IEEE Trans. Info. Theory Vol. 57, pp 6379-6396, Oct 2011.[Slides]

H. Permuter and H. Asnani  “Multiple Access Channel with Partial and Controlled Cribbing Encoders,” IEEE Trans. Info. Theory Vol. 59, pp  2252-2266 , Oct 2013.[Slides]

T. Kopetz , H. Permuter and S. Shamai,   “Multiple Access Channels with Combined Cooperation and Partial Cribbing,” Accepted to IEEE Trans. Info. Theory 

L. Dikstein , H. Permuter and Y. Steinberg,   “On State Dependent Broadcast Channels with Cooperation,” accepted to IEEE Trans. Info. Theory 

Z. Goldfeld , H. Permuter and G. Kramer,   “Semi-Deterministic Broadcast Channels with Cooperation and a Dual Source Coding Problem,” Submitted to IEEE Trans. Info. Theory 

R. Kolte, and H. Permuter,   “Cooperative Binning for Semideterministic Channels,”  IEEE Trans. Info. Theory Vol. 62, pp  1231-1249 , 2016. [Slides] 

Network coding
M. Lvov and H. Permuter,  “Initialization Algorithms For Convolutional Network Coding,” Submitted to  IEEE Trans. Info. Theory [Slides]

N. Voskoboynik, H. Permuter, A. Cohen, "On the Capacity of Wireless Networks with Random Transmission Delay," Submitted to IEEE/ACM Transactions on Networking

mac with delayed state information at the encoders
Dealyed state information
U. Basher, A. Shirazi and H. Permuter, “Capacity Region of Finite State Multiple-Access Channel with Delayed State Information at the Transmitters IEEE Trans. Info. Theory Vol. 58, pp 189-206, 2012. [Slides]

O. Simeone and H. Permuter  “Source Coding When the Side Information May Be Delayed” IEEE Trans. Info. Theory Vol. 59, pp  3607-3618 , Feb 2013.

Z. Goldfeld,  H. Permuter and B. Zaidel, “The Finite State MAC with Cooperative
Encoders and Delayed CSI
 IEEE Trans. Info. Theory Vol. 60, pp  6181-6203 , Oct 2014.. [Slides]

Physical layer security
Z. Goldfeld , H. Permuter and G. Kramer,   “Broadcast Channels with Privacy Leakage Constraints,” Submitted to IEEE Trans. Info. Theory

Z. Goldfeld , P. Cuff and H. Permuter, “Semantic-Security Capacity for Wiretap Channels of Type II,” Submitted to IEEE Trans. Info. Theory 

Communication Through Finite State Channels, Possibly with Feedback:
H. Permuter, P. Cuff, B. Van Roy, and T. Weissman, “Capacity of the Trapdoor Channel with Feedback,”   IEEE Trans. Info. Theory,  July 2008 [Slides]

H. Permuter, T. Weissman and A. Goldsmith, “Finite state channels with time-invariant deterministic feedback,”  IEEE Trans. Info. Theory, Feb 2009. [Slides]

H. Permuter, J. Chen and  T. Weissman, “Capacity Region of the Finite-State Multiple Access Channel with and without Feedback,” IEEE Trans. 
Info. Theory,
June 2009

B. Shrader and H. Permuter “Feedback capacity of the compound channel,”  IEEE Trans. Info. Theory, Vol 55, pp 3629 - 3644,  August 2009 [Slides]

L. Zhao and H. Permuter  “Zero-error feedback capacity via dynamic programming,”  IEEE Trans. Info. Theory. Vol. 56, June 2010. [Slides]

J. Chen, H.  Permuter,  and  T. Weissman, “Tighter Bounds on the Capacity of Finite-State Channels via Markov Set-Chains,”  IEEE Trans. Info. Theory. Vol. 56, pp 3660 - 3691, Aug. 2010  

O. Elischo and H. Permuter “Capacity and coding for the Ising Channel with Feedback,”  IEEE Trans. Info. Theory Vol. 60, pp  5138-5149 , Sep 2014.  [Slides]

 H. Permuter, H. Asnani and T. Weissman, “Capacity of a POST Channel with and without Feedback,IEEE Trans. Info. Theory Vol. 60, pp  6067 , Oct 2014. [Slides]

O. Sabag,  H. Permuter and N. Kashyap,  “Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint,” IEEE Trans. Info. Theory Vol. 62, pp  8-22 2016

coordinatiomCoordination and Rate Distortion:
T. M. Cover and H. Permuter,  “Capacity of Coordinated Actions,”  ISIT 2007, Nice, France.[Slides]

P. Cuff, H. Permuter, T. M. Cover. “Coordination Capacity.” IEEE Trans. Info. Theory. Vol. 56, Sep. 2010.

H. Permuter, Y. Steinberg and  T. Weissman, “Two-way source coding with a helper,” IEEE Trans. Info. Theory, Vol. 56, pp 2905 - 2919, June 2010 [Slides]

J. Wang, J. Chen, L. Zhao, P. Cuff, H. Permuter, “On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding”  IEEE Trans. Info. Theory, Vol. 57, pp 1443 - 1456, March 2011 [Slides]

H. Permuter and T. Weissman, “Cascade and Triangular Source Coding with Side Information at the First Two Nodes IEEE Trans. Info. Theory. Vol. 58, pp 3339-3349, 2012..[Slides]

Y.K. Chia,  H. Permuter and T. Weissman, “Cascade, Triangular and Two Way Source Coding with 
degraded side information at the second user
”  IEEE Trans. Info. Theory, Vol. 58, pp 189 -206, Jan 2012

chain rule

Causal conditioning, Directed information, Estimation and Portfolio Theory:
H. Permuter, Y.-H Kim and T. Weissman, “Interpretations of Directed Information in Portfolio Theory, Data Compression, and Hypothesis Testing” IEEE Trans. Info. Theory, Vol. 57, pp 3248 -3259,  2011[Slides]

I. Naiss and H. Permuter, “Extension of the Blahut-Arimoto Algorithm for Maximizing Directed Information”  IEEE Trans. Info. Theory, Vol. 59, pp 204 -222,  2013.[Slides]

I. Naiss and H. Permuter, “Computable Bounds for Rate Distortion with Feed-Forward for Stationary and Ergodic Sources” IEEE Trans. Info. Theory, Vol. 59, pp 760 -781,  2013.

Y. -H Kim,  H. Permuter and T. Weissman, “Directed Information, Causal Estimation, and Communication in Continuous Time,”  IEEE Trans. Info. Theory, Vol. 59, pp 1271-1287,  2013.[Slides]

J. Jiantao, H. H. Permuter, Z. Lei,  Y.-H Kim and T. Weissman, “Universal Estimation of Directed InformationIEEE Trans. Info. Theory, Vol. 59, pp 6220-6242,  2013y. [code[Slides]

Actions in communication 
T. Weissman and H. Permuter , “Source Coding with a Side Information “Vending Machine” ”  IEEE Trans. Info. Theory 
Vol. 57, pp 4530-4544,  2011

H. Asnani,  H. Permuter and T. Weissman, “Probing Capacity” IEEE Trans. Info. Theory Vol. 57, pp 7317-7332,  2011.side information "vending machine"

L. Dikstein,  H. Permuter and ,  S. Shamai,, “MAC with Action-Dependent State Information at One Encoder” 
IEEE Trans. Info. Theory Vol. 61, pp 173-188,  2015.. [Slides]

H. Asnani,  H. Permuter and T. Weissman, “To Feed or Not to Feed BackIEEE Trans. Info. Theory Vol. 60, pp 5150-5172, 2014.

B Ahmadi,  H. AsnaniO. Simeone and H. Permuter , “Information Embedding on ActionsIEEE Trans. Info. Theory Vol. 60, pp 6902-6916, 2014.

O. Sabag,  H. Permuter and  A. Cohen,  “Lossless Coding of Correlated Sources with Action,” Submitted to  IEEE Trans. Info. Theory

Interference channel 
R. Kolte, and H. Permuter,   “Multicoding Schemes for Interference Channels,” Submitted to IEEE Trans. Info. Theory [Slides] 

Source coding with cooperation/cribbing

H. Asnani,  H. Permuter and T. Weissman, “Successive Refinement with Decoder Cooperation and its Channel Coding Duals”  IEEE Trans. Info. Theory Vol. 59, pp 5511-5533, 2013.

Relation between Statistical Physics and Information Theorey
D. A. Vinkler, H. Permuter and N. Merhav, “Analogy Between Gambling and Measurement-Based Work Extraction”  submitted to IEEE Trans. Info. Theory. [Slides]

Image and signal processing:
H. Permuter and J.M. Francos , “Estimating the orientation of planar Surfaces: Algorithms and Bounds.” IEEE Trans. Info. Theory, vol. 46 pp. 1908-1920, August 2000.

J.M. Francos and H. Permuter, “Parametric Estimation of Orientation of Textured Planar Surfaces,” IEEE Trans. Image Process., vol. 10, pp. 403-418, March 2001. [ Slides]

H. Permuter, J.M. Francos and I. JermynA study of Gaussian mixture models of color and texture features for image classification and segmentation,Pattern Recognition vol. 39, pp. 695-706, February 2006. (Conf. version)


Software developed in our group

FME-IT package for Mat-Lab: Fourier-Motzkin elimination (FME) algorithm for information theoretic inequalities. This package combines the FME procedure together with an information theoretic inequality prover (ITIP). It was written primarily by Ido B. Gattegno.

Blahut-Arimoto Algorithm for optimizing the the directed information: we provide algorithm based on Blahut-Arimoto for maxmizing the dircted information for computing  channel capacity with feedback and and minimizng the directed information for computing the rate distorstion with feedforward. this code was written in c by Iddo Naiss.

Universal Estimation of Directed Information: The software is a MATLAB package that can calculate the directed information and mutual information between any two input sequences. It uses the universal sequential probability assignment induced by Context-Tree Weighting Method, and has desirable convergence properties.

Some Links:

IEEE Information theory society, Information Theory student resources, ISIT 2015, movie on Shannon, Information theory on wikipedia.

Short Bio

Haim Permuter received his B.Sc. (summa cum laude) from Ben-Gurion University (BGU) and Ph.D. from Stanford University, both in in Electrical Engineering, in 1997 and 2008, respectively.  Between 1997-2004, he served as a scientific research officer in an R&D unit in the Israeli Defense Forces. In summer 2002 he worked for IBM, Almaden research center. He is a recipient of several rewards including Eshkol Fellowship, Wolf Award,  Fulbright FellowshipStanford Graduate Fellowship, and Allon Fellowship.  Haim joined the faculty of Electrical Engineering Department at BGU in Oct 2008, and is now an associate proffesor.