Welcome To
Haim Permuter's Homepage
Teaching Reseach Interstets Publication Links Bio

Address: Fax:
97286472949 Office:
312 in Building
33 
Information theory, Machine Learning, Sequential Prediction, 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.
Machine
Learning
H. Permuter,
J.M. Francos
and
I.
Jermyn “A
study of Gaussian mixture models of color and texture features for
image classification and segmentation,” Pattern
Recognition
vol. 39, pp. 695706, February 2006.
(Conf. version)
Z. Aharoni, G. Rattner, H. Permuter “Gradual Learning of Deep Recurrent Neural Networks,” Arxiv 2017, CSCML (Cyber Security Cryptography and Machine Learning) 2018.
R. Shoham, H. Permuter “Highway State Gating for Recurrent Highway Networks: improving information flow through time,” Arxiv 2018, CSCML (Cyber Security Cryptography and Machine Learning) 2018.
R. Shoham, H. Permuter “Amended CrossEntropy cost: an approach forencouraging diversity in classification ensemble,” CSCML (Cyber Security Cryptography and Machine Learning) 2019. [Slides]
Cooperative
communication
H. Permuter,
S.
Shamai,
and A. SomekhBaruch,
“Message and
state cooperation in multiple access channels,” IEEE Trans. Info. Theory
Vol. 57, pp 63796396, 2011.[Slides]
H. Permuter
and H.
Asnani “Multiple
Access Channel with Partial and Controlled Cribbing Encoders,” IEEE Trans. Info. Theory
Vol. 59, pp 22522266 ,
2013.[Slides]
T. Kopetz , H. Permuter and S. Shamai, “Multiple Access Channels with Combined Cooperation and Partial Cribbing,” IEEE Trans. Info. Theory Vol. 62, pp 825848 , 2016
L. Dikstein , H. Permuter and Y. Steinberg, “On State Dependent Broadcast Channels with Cooperation,” IEEE Trans. Info. Theory Vol. 62, pp 23082323, 2016
Z. Goldfeld , H. Permuter and G. Kramer, “SemiDeterministic Broadcast Channels with Cooperation and a Dual Source Coding Problem,” IEEE Trans. Info. Theory Vol. 62, pp 22852307, 2016 [Slides]
R. Kolte, A. Özgür and H. Permuter, “Cooperative Binning for Semideterministic Channels,” IEEE Trans. Info. Theory Vol. 62, pp 12311249 , 2016. [Slides]
Network
coding
M. Lvov and H. Permuter,
“Initialization
Algorithms For Convolutional Network Coding,” IEEE Trans. Info. Theory Vol.
64, pp 52775295 ,
2018 [Slides]
State
information
U. Basher, A. Shirazi and H. Permuter, “Capacity Region of
Finite State MultipleAccess Channel with Delayed State Information at
the Transmitters” IEEE
Trans. Info. Theory Vol. 58, pp 189206, 2012.
[Slides]
O. Simeone and H. Permuter “Source Coding When the Side Information May Be Delayed” IEEE Trans. Info. Theory Vol. 59, pp 36073618 , Feb 2013.
Z. Goldfeld, H. Permuter and B. Zaidel, “The Finite State MAC with CooperativeA. Shirazi, U. Basher and H. Permuter, “Channel Coding and Source Coding With Increased Partial Side Information” Entropy 19, pp 467 2017.
Physical
layer security
Z. Goldfeld
, P. Cuff
and H.
Permuter, “Arbitrarily
Varying Wiretap Channels With Type Constrained States,” IEEE Trans. Info. Theory
Vol. 62, pp 72167244,
2016
Z. Goldfeld
, H.
Permuter and G.
Kramer,
“Broadcast
Channels with Privacy Leakage Constraints,” IEEE Trans. Info. Theory
Vol. 63, pp 51385161,
2017
Z. Goldfeld , P.
Cuff and H.
Permuter, “SemanticSecurity
Capacity for Wiretap Channels of Type II,” IEEE Trans. Info. Theory
Vol. 62, pp 38633879,
2016
Z. Goldfeld ,G.
Kramer, P.
Cuff and H.
Permuter, “Strong
Secrecy for Cooperative Broadcast Channels,” IEEE Trans. Info. Theory
Vol. 63, pp 469495,
2017
Z. Goldfeld
, H.
Permuter,
“MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages,” IEEE Trans. Info. Theory
Vol. 65, pp 25242544,
2019
Z. Goldfeld , H. Permuter, “Wiretap and GelfandPinsker Channels Analogy and Its Applications,” IEEE Trans. Info. Theory Vol. 65, pp 49794996, 2019
Communication Through
Finite State Channels 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 timeinvariant deterministic feedback,” IEEE Trans. Info. Theory, Feb 2009. [Slides]
H.
Permuter, J.
Chen and
T. Weissman,
“Capacity
Region of the FiniteState 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 “Zeroerror 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 FiniteState Channels via Markov SetChains,” 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 51385149 , 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]
Oron Sabag, H. Permuter and N. Kashyap, “Capacity of the Binary Erasure Channel With a NoConsecutiveOnes Input Constraint,” IEEE Trans. Info. Theory Vol. 62, pp 822, 2016 [Slides]O. Sabag, H. Permuter and H. Pfister, “A SingleLetter Upper Bound on the Feedback Capacity of Unifilar FiniteState Channels,” IEEE Trans. Info. Theory Vol. 63, pp 13921409, 2017 [Slides]
O. Sabag, H. Permuter and N. Kashyap, “Feedback capacity and coding for the BIBO channel with a norepeatedones input constraint,” IEEE Trans. Info. Theory , 2018.
O. Peled, O. Sabag, and H. Permuter, “Feedback Capacity and Coding for the (0, k)RLL InputConstrained BEC,” IEEE Trans. Info. Theory , Vol. 65, pp 40974114, 2019.
Coordination
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, “Twoway 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 Reﬁnement Layer in Multiple Description Coding and Scalable Coding” IEEE Trans. Info. Theory, Vol. 57, pp 1443  1456, March 2011 [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
Causal conditioning, Directed information, Estimation and Portfolio Theory:
I. Naiss
and H. Permuter, “Computable
Bounds for Rate Distortion with FeedForward 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 12711287, 2013.[Slides]
J. Jiantao, H.
H. Permuter, Z. Lei, Y.H
Kim and T.
Weissman,
“Universal
Estimation of Directed Information” IEEE Trans. Info. Theory, Vol.
59, pp 62206242, 2013. [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
45304544, 2011
H. Asnani,
H. Permuter and T.
Weissman,
“Probing Capacity” IEEE Trans. Info. Theory
Vol. 57, pp 73177332, 2011.
L.
Dikstein, H. Permuter and ,
S. Shamai,,
“MAC with
ActionDependent State Information at One Encoder”
IEEE Trans. Info. Theory
Vol. 61, pp 173188, 2015.. [Slides]
H. Asnani,
H. Permuter and T.
Weissman,
“To Feed or Not
to Feed Back” IEEE
Trans. Info. Theory
Vol. 60, pp 51505172, 2014
B Ahmadi, H. Asnani, O. Simeone and H. Permuter , “Information Embedding on Actions” IEEE Trans. Info. Theory Vol. 60, pp 69026916, 2014.
O. Sabag, H. Permuter and A. Cohen, “Lossless Coding of Correlated Sources with Action,” IEEE Trans. Info. Theory Vol. 63, pp 469495, 2017
Interference
channel
R. Kolte,
A. Özgür and
H.
Permuter,
“Multicoding
Schemes for Interference Channels,” IEEE Trans. Info. Theory
Vol. 62, pp 49364952,
2016 [Slides]
Energy
Harvesting Wireless Communications
D. Shaviv,
A. Özgür and
H.
Permuter,
“Capacity
of Remotely Powered Communicatio,” IEEE Trans. Info. Theory
Vol. 63, pp 469495,
2017
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 55115533, 2013.
Relation between Statistical
Physics and Information Theorey
D. A. Vinkler, H. Permuter and N. Merhav,
“Analogy Between
Gambling and MeasurementBased Work Extraction” Journal of Statistical Mechanics: Theory and Experiment, 2016. [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. 19081920, August 2000.
J.M.
Francos
and H. Permuter, “Parametric
Estimation of Orientation of Textured Planar Surfaces,”
IEEE Trans. Image Process., vol. 10, pp. 403418,
March 2001. [ Slides]
H. Permuter, J.M. Francos and I. Jermyn “A study of Gaussian mixture models of color and texture features for image classification and segmentation,” Pattern Recognition vol. 39, pp. 695706, February 2006. (Conf. version)
FMEIT package for MatLab: FourierMotzkin 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.
BlahutArimoto Algorithm for optimizing the the directed information: we provide algorithm based on BlahutArimoto 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 ContextTree Weighting Method, and has desirable convergence properties.
IEEE Information theory society, Information Theory student resources, ISIT 2018, movie on Shannon, Information theory on wikipedia. Wiki Page of our group
Haim Permuter received
his B.Sc.
(summa cum laude) from
BenGurion
University
(BGU) and Ph.D. from Stanford University,
both in in Electrical
Engineering, in 1997 and 2008, respectively. Between
19972004, 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 Fellowship,
Stanford
Graduate
Fellowship, U.S.Israel Binational Science Foundation Bergmann Memorial Award, and Allon
Fellowship. Haim joined the faculty of
Electrical Engineering Department
at BGU in Oct 2008 as a tenuretrack faculty, and is
now a Professor, LuckHille Chair in Electrical Engineering.
Haim
also serves as head of the communication, cyber and information track
in his department. Haim served on the editorial boards of the IEEE
Transactions on Information Theory in 20132016.