Communication, Control and Signal Processing Seminar


Spring 2018
02/08 Ajaykrishnan Nageswaran (UMD) Data Privacy for a $\rho$-Recoverable Function
02/15 Abram Kagan (UMD) Efficiency Requires Innovation
02/22 Yi-Peng Wei (UMD) Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching
03/08 Radu Balan (UMD) Low-rank Matrix Estimation and Rank-one Matrix Decompositions: When Nonlinear Analysis meets Statistics
03/29 Hamed Hassani (University of Pennsylvania) Non-asymptotic Analysis of Codes and its Practical Significance
05/02 Mohammad Hassan Lotfi (UMD) Bayesian Congestion Games with Traffic Manager


Fall 2017
09/07 Karim Banawan (UMD) The Capacity of Private Information Retrieval from MDS-Coded Databases
09/12 Itzhak Tamo (Tel Aviv University) Optimal repair of polynomials: Achieving the cut-set bound
09/21 Ahmed Arafa (UMD) Age-Minimal Transmission in Energy Harvesting Two-hop Networks
10/05 Yuval Cassuto (Technion) Coding with Histograms for Flash-Memory Errors
10/19 Yury Polyanskiy (MIT) Sample Complexity of Population Recovery
11/09 Zitan Chen (UMD) MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
12/07 Sina Miran (UMD) Real-Time Tracking of Selective Auditory Attention from M/EEG: A Bayesian Filtering Approach


Spring 2017
02/09 Abbas Kazemipour (UMD) Fast and Stable Signal Deconvolution via Compressible State-Space Models
03/01 Ayfer Ozgur (Stanford) Cover's Open Problem: "The Capacity of the Relay Channel''
03/09 Aneesh Raghavan (UMD) Detection of Markov Chain Models from Observed Data using Binary Hypothesis Testing and Consensus
03/16 Ajaykrishnan Nageswaran (UMD) The Asymptotics of Posterior Entropy and Error Probability for Bayesian Estimation
04/06 Proloy Das (UMD) Specto-temporal pursuit algorithm: an IRLS based decomposition technique
04/13 Min Ye (UMD) Optimal Schemes for Discrete Distribution Estimation under Locally Differential Privacy
04/20 Debdipta Goswami (UMD) Global bilinearization and controllability of control-affine nonlinear systems: A Koopman Spectral Approach
06/12 Amin Rahimian (UPenn/MIT) Group Decision Making and Social Learning


Fall 2016
09/08 Prashanth L. A. (UMD) Model-free optimization of human preferences in stochastic systems
09/15 Alborz Alavian (UMD) Polynomial Algorithms for Lower-Bounds on the k-th Singular Value of a Polynomial Matrix
09/29 Zitan Chen (UMD) The Capacity of Online (Causal) q-ary Error-Erasure Channels
10/6 P. Vijay Kumar (IISc) Binary Codes with Locality for Multiple Erasures Having Short Block Length
10/13 Zitan Chen, continued (UMD) The Capacity of Online (Causal) q-ary Error-Erasure Channels
10/20 Vinay Praneeth Boda (UMD) Sampling Rate Distortion
10/27 Yingquan Wu (Micron Technology) LDPC for flash - from theory to practice
11/3 Paul Cuff (Princeton University) Part I: Wiretap Channels with Random States
Part II: Differential Privacy as a Mutual Information Constraint

11/10 Dipankar Maity (UMD) Optimal Strategies for Stochastic Linear Quadratic Differential Games with Costly Information
11/17 Ahmed Arafa (UMD) Optimal Policies for Wireless Networks with Energy Harvesting Transmitters and Receivers: Effects of Decoding Costs
12/1 Aditya Ramamoorthy (Iowa State) Combinatorial designs for distributed storage, function computation and coded caching
12/8 Himanshu Tyagi/ Shun Watanabe (IISc/TUAT) Interactive Data Exchange


Spring 2016
02/04 Berk Gurakan (UMD) Energy Harvesting Multiple Access Channel with Data Arrivals
02/11 Min Ye (UMD) Explicit constructions of MDS array codes with optimal repair bandwidth
02/18 Ameera Chowdhury (Rutgers University) Inclusion Matrices and the MDS Conjecture
02/25 Itzhak Tamo (Tel Aviv University) The polynomial method and the entropy function applied to counting
03/10 Alexander Barg (UMD) On the Construction of Polar Codes for Arbitrary DMCs
03/31 Konstantinos Gatsis (UPenn) Resource Management for Wireless Sensor-Actuator Systems
04/07 Udit Halder (UMD) Pursuit and Classical Mechanics
04/14 Marcos Vasconcelos (UMD) Estimation of discrete random variables over the collision channel with minimum probability of error
06/16 Alexander Barg (UMD) Codes, metrics and applications


Fall 2015
09/10 Netanel Raviv (Technion/MIT) Construction of high-rate MSR codes over small fields.
09/17 Vinay Praneeth Boda (UMD) Non-Asymptotic Achievability Bounds in Information Theory.
09/24 Itzhak Tamo (Tel-Aviv University) Explicit [n,k] Minimum-Storage Regenerating Code for all d's in the range {k, k+1,...n-1} simultaneously.
10/08 Yuval Kochman (Hebrew University) Finite-blocklength lossy compression of infinite sequences.
10/15 Alborz Alavian (UMD) Measures of Decentralized Controllability and Observability.
10/22 Pritam Mukherjee (UMD) Real interference alignment in multiple access wiretap channels.
10/29 Min Ye (UMD) Cyclic equivalence relation of polar codes under addition modulo q operation.
11/05 Zitan Chen (UMD) Capacity for binary causal adversarial channels
11/12 Prashanth L. A (UMD) Concentration bounds for TD(0) with function approximation
11/19 Abbas Kazemipour (UMD) Robust Estimation of Self-Exciting Point Process with Application to Neuronal Modeling.
12/03 Hen Qiao (UMD) Structured Phase Retrieval with Partial Nested Fourier Sampler.


Spring 2015
02/19 Alexey Frolov (IITP RAS, Moscow) On Multi-Threshold Decoding of q-ary LDPC codes
02/26 Alborz Alavian (UMD) Stabilizing Decentralized Systems with Arbitrary Information Structure
03/12 Sikai Qu (UMD) Zero-one law for the absence of isolated nodes for Multiplicative Attributes Graph
03/26 Janis Notzel (Technische Universitat Munchen) Arbitrarily Varying Wiretap Channel
04/02 Abbas Kazemipour (UMD) Robust Estimation of Self-Exciting Point Process with Application to Neuronal Modeling
04/13 Arya Mazumdar (UMN) Can we have local repair over a network?
04/23 Maice Costa (UMD) On the characterization of the age of information


Fall 2014
10/16 Katie Haymaker (Villanova University) Using a Graph Perspective to Investigate Bit Assignments for Codes
10/30, 11/6 Prakash Narayan (UMD) Interactive Function Computation
11/20 Marcos Vasconcelos (UMD) Distributed Estimation over the Collision Channel
12/04 Siddharth Pal (UMD) Learning in Games
12/10 Sunav Choudhary (USC) Identifiability Analysis in Bilinear Inverse Problems with Application to Sparse Blind Deconvolution
12/11 Biswadip Dey (UMD) Data Smoothing via Optimal Control


Spring 2014
02/20 Behtash Babadi (UMD) Asymptotic achievability of the Cram\E9r-Rao bound and a compound channel-type universal sufficiency condition for noisy sparse support recovery
03/06,03/25 Piya Pal (UMD) Sub-Nyquist Sampling for Wideband Signals
03/11 Isaak Mayergoyz (UMD) Mathematical Models of Hysteresis
04/01 Talha Cihad Gulcu (UMD) Interactive Function Computation via Polar Coding
04/08 William J. Martin (WPI) Promise, Progress, and Problems in Homomorphic Encryption
04/15,04/22 Praneeth Boda, Itzahak Tamo (UMD) Analysis of Boolean Functions
04/29 Min Ye (UMD) Polar Codes for Distributed Hierarchical Source Coding


Fall 2013
08/23 Ioannis Lambadaris (Carleton University, Canada) Stability Analysis and Delay Optimality in Multi-Queue Multi-Server (MQMS) Systems
09/18 Sirin Nitinawarat (UIUC) Controlled Sensing for Sequential Multihypothesis Testing
09/26 Itzhak Tamo (UMD) Non-linear index coding outperforming the linear optimum
10/07 (In conjunction with Advanced Network Colloq series) Shlomo Shamai (Technion\97Israel Institute of Technology) Cloud Radio Access Downlinks, with Backhaul Constrained Oblivious Processing
10/08 (In conjunction with HyNet Colloq series) Amos Lapidoth (ETH, Switzerland) Source Coding with Lists and R\E9nyi Entropy
10/17 Talha Cihad Gulcu (UMD) Polar codes: Speed of polarization and polynomial gap to capacity
10/24 Raef Bassily (PSU) Causal Erasure Channels
10/31,11/21 Itzhak Tamo (UMD) A Family of Locally Recoverable Codes
11/07,11/14 Shun Watanabe (UMD) Non-Asymptotic and Second-Order Achievability Bounds for Source Coding with Side-Information
11/28 Thanksgiving, no talk
12/05 Praneeth Boda (UMD) Source Coding Problem for Sources with Additional Outputs to Keep Secret from the Receiver or Wiretappers


Spring 2013
02/07 Marcelo Firer (U Campinas, Brazil) Coding in the Presence of Semantic Value of Information
02/21 Itzhak Tamo (UMD) What I heard at the ITA
03/20 Vijay Subramanian (Northwestern University) Network Games: Spotting Trendsetters and Bargaining With Middlemen
03/26 Sidharth Jaggi (CUHK) Robust sparse recovery and applications: order-optimal measurements and complexity
03/28 Sikai Qu (UMD) Introduction to Hamersley-Clifford Theorem
04/04 Sikai Qu (UMD), continued
04/11 Praneeth Boda (UMD) A Decomposition theorem for Binary Markov Random Fields
04/18 Isaak Mayergoyz (UMD) Riemann Hypothesis and Plasmon Resonances
04/23 Venu Veeravalli (UIUC) Data-Efficient Quickest Change Detection
05/02 Daniel Cullina (UIUC) Upper Bounds on the Size of Deletion Correcting Codes
05/08 Rajesh Sundaresan (IISC) Recursive Distributional Equations, Endogeny, and Belief Propagation via Three Examples
05/23 Ufuk Topcu (UPENN) Networked, Information-Based Systems: Synthesis of Correct-By-Construction Control Protocols


Fall 2012
09/20 Himanshu Tyagi (UMD) How Many Queries Will Resolve Common Randomness?
09/27 Woomyoung Park (UMD) New results on q-ary polar codes, q=2^r
10/04 Talha Cihad Gulcu (UMD) Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

10/11 Talha Gulcu, continued
10/1 Olgica Milenkovic (UIUC)
,
 A Constrained-Distance Based Approach to Social Choice Theory
11/12
Rahul Jain (USC) The Art of Gambling in a Team: Multi-player multi-armed bandits
11/22 Thanksgiving, no talk
11/29 Daniel Costello (U. Notre Dame)
Coupled Sparse Codes on Graphs: A Convolutional Coding Perspective
Note: Prof. Costello gives an ISR Distinguished Lecture "The Genesis of Coding Theory" on Friday 11/30, 10am, AVW 2460
12/06 Itzhak Tamo (UMD) Zigzag Codes: MDS Array Codes with Optimal Rebuilding


Spring 2012

02/09 Himanshu Tyagi (UMD) Fault-tolerant secret key generation
02/16 no seminar
02/23 Alexander Barg (UMD)
Polar codes for q-ary channels, q=2^r
03/01
Raef Bassily (UMD), A cryptographic treatment of the wiretap channel: An optimal, explicit, and efficient encryption
03/08 Vinay Vaishampayan (AT&T Labs) Query Matrices for the Hamming Oracle
03/15
Raef Bassily, cont'd.
03/29 Yuval Lomnitz (Tel Aviv University)
Universal communication over unknown channels (with feedback)
04/05, 4/12
David Ward (UMD) Introduction to Team Decision Problems
4/19, 4/26
Maya Kabkab (UMD) Equilibrium selection in repeated coordination games
5/3 Anup Menon (UMD) Cheeger inequality for edge expansion
 


Fall 2011

09/22 Woomyoung Park (UMD) Multilevel polarization for nonbinary codes and parallel channels
10/06, 10/13 Prakash Narayan (UMD) Multiuser secrecy, data compression and transmission , I,II
10/20 Alexander Barg (UMD) Statistical RIP and sparse recovery

10/27 Wei-Hsuan Yu (UMD) Introduction to frame theory
11/03 Radu Balan (UMD) Cramer-Rao Lower Bounds and Estimators for a Nonlinear Signal Processing Problem
11/10 Himanshu Tyagi (UMD) Minkowski dimension of large probability sets scales as R\E9nyi dimension
11/17 Kaustubh Jain (UMD) Relationship between Heavy-Tails and Self-Similarity
11/24 Thanksgiving break
12/1 Armand Makowski (UMD) Long live stochastic approximation
12/8 no seminar (talk of Sanjeev Khudanpur postponed)
12/15 Marcelo Firer (U Campinas, Brazil)
Semantic value of information in Coding Theory


Spring 2011

02/24 Arya Mazumdar (UMD) Constructions of matrices  with restricted isometry property for compressive sampling
03/03 Cybersecurity talk
03/07 Pascal Vontobel (HP Labs) Should We Believe in Numbers Computed by Loopy Belief Propagation?
03/10 Armand Makowsky (UMD) Some remarks on random graphs
04/07 Isaak Mayergoyz (UMD), Landau-Lifshitz Magnetization Dynamics Driven by a Jump-Noise Process

04/14 Benjamin Kedem (UMD) Integration of information from multiple sources
04/21 Abram Kagan (UMD) Semiparametric Estimation for Kernel Families
04/22 Tsachy Weissmann (Stanford) Mutual Information, Relative Entropy, and the Costs of Causality and of Mismatch in Estimation
05/05 Himanshu Tyagi (UMD)
Relationships Between Certain Quantities of Information Theory and Statistics

05/12 Raef Bassily (UMD)


Fall 2010

09/23 Maxim Raginsky (Duke University), Empirical Processes, Typical Sequences and Coordinated Actions in Standard Borel Spaces
10/07 Arya Mazumdar (UMD), Codes for High Density Magnetic Recording on a 1-d Granular Medium
10/14 Green Communications Workshop
10/28 Woomyoung Park (UMD), Linear Ordered Codes, Shape Enumerators, and Parallel Channels
11/04 Ersen Ekrem (UMD), An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel (I)
11/11 Ersen Ekrem (UMD), An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel (II)
12/02 Anna Pantelidou (University of Oulu, Finland)  Single-hop Versus Multi-hop Transmission for Energy-efficient Multicasting
12/09 Arya Mazumdar (UMD)
Combinatorial Non-Adaptive Group Testing


Spring 2010

02/18, 02/25 Sirin Nitinawarat (UMD), On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding
03/11 Arya Mazumdar (UMD), Coding for High-Density Magnetic Recording
03/25 Alexander Barg (UMD), Codes with a strong parent-identifying property
04/01 Ravi Tandon (UMD), Secure Source Coding with a Helper
04/08 Sirin Nitinawarat (UMD), Maximal Error Capacity Regions Are Smaller than Average Error Capacity Regions for Multi-user Channels
04/22 Avinash Varna (UMD), Modeling and Analysis of Multimedia Content Identification using Binary Fingerprints
05/06 Osman Yagan (UMD), Random graph modeling of key distribution schemes in wireless sensor networks
05/13  S. Sandeep Pradhan (University of Michigan), Toward a new approach to distributed information processing: Harnessing group structure
05/20 Himanshu Tyagi (UMD), Secure computing
06/10 Grigory Kabatiansky (IPPI RAS, Moscow), Authentication Codes and Coding Theory
06/30 Himanshu Tyagi (UMD)
Polar Codes


Fall 2009

09/10 Alexander Barg (UMD), Bounds On the Size of Sets with Few Distances
09/17  Navin Kashyap (Queen's University at Kingston), Complexity of Graphical Realizations of Linear Codes
09/24 Navin Kashyap (Queen's University at Kingston), Complexity of Graphical Realizations of Linear Codes
10/01 Hiroshi Nozaki (U. Texas, Brownsville and Tohoku University), Geometrical approach for strongly regular graphs
10/08 Arya Mazumdar (UMD), Rank Permutation Codes
10/15 Punarbasu Purkayastha (UMD), Near-MDS ordered codes and distributions
10/22 Alexander Barg (UMD), On the number of errors correctable with codes on graphs
10/29 Himanshu Tyagi (UMD), Secure Computation
11/05 Sirin Nitinawarat (UMD), Perfect Secrecy, Perfect Omniscience and Steiner Tree Packing
11/19 Yury Polyanskiy (Princeton), Achievability bounds in the regime of fixed probability of error
12/10 Ravi Tandon (UMD),
Dependence Balance Bounds for Gaussian Networks with Cooperation and Feedback


Spring 2009

02/12 Alexander Barg (UMD), Polarization Codes
02/19 Arya Mazumdar (UMD), Linear Balancing Sets
02/26 No Seminar
03/05 Prasanth Anthapadmanabhan (UMD), Two-level Fingerprinting Codes
03/12 Gabriel Lipsa (UMD), Optimal Distributed State Estimation with Communication Cost: A Majorization Theory Approach
03/25 S. Sandeep Pradhan (University of Michigan), Toward a New Approach to Distributed Source Coding: Harnessing Group Structure
04/02 Punarbasu Purkayastha(UMD), List Decoding Size and Weight distribution of Reed Muller Codes
04/09 Sirin Nitinawarat(UMD), Secrecy, Perfect Omniscience and Steiner Tree Packing
04/23 Himanshu Tyagi (UMD), Strong Converse and Sphere Packing Bound for Channel with States
04/30 Arash Komaee (UMD), Nonlinear Filters for Pulse Arrival Detection in the Presence of White Gaussian Noise
05/14 Grigory Kabatiansky, IITP RAS (Moscow,Russia),
Reed-Muller Codes and Their List Decoding


Fall 2008

09/11 Anuj Rawat (UMD), Coloring Rooted Subtrees of a Bidirected Tree
09/18 Himanshu Tyagi (UMD), Proof of Converse of Burnashev's Reliability Function for DMC with Feedback
10/02 Arya Mazumdar (UMD), Compressed Sensing: A coding Theoretic Perspective
10/16 Sirin Nitinawarat (UMD), Information-theoretic Limits on Sparsity Pattern Recovery in High-Dimensional and Noisy Setting
10/23 Professor Damianos Karakos (Johns Hopkins University) , Computation of Csisz\E1r's Mutual Information of Order Alpha
10/30 Ravi Tandon (UMD), Outer Bounds for the Multiple Access Channel with Feedback
11/05 Ghid Maatouk (EPFL), Recursions for the LT Decoder
12/04 John Baras (UMD), Dynamic Network Security Deployment under Partial Information
12/11 A. Samorodnitsky (Hebrew University),
What Makes the Linear Programming Bounds for Codes so Good?
 


Spring 2008

02/07 J\F8rn Justesen (Technical University of Denmark), Cores in Random Graphs and Some Applications to Error-correcting Codes
02/14 Arya Mazumdar (UMD), Thresholds for Codes on Bipartite Graph
02/21 No seminar
02/28 Sirin Nitinawarat, Secret Key Generation for a Pairwise Independent Network Model
03/06 Anna Pantelidou, A Cross-layer Approach for Stable Throughput Maximization under Channel State Uncertainty
03/13 Arash Komaee, State Estimation with Point Process Observation
03/20 Spring break
03/37 N. Prasanth Anthapadmanabhan, Intersections of Random Graphs
04/03 Alexander Barg,  Weight distribution and decoding of codes on hypergraphs
04/10 No Seminar,
04/17  P. S. Krishnaprasad (UMD),   Information Geometry and Dynamics on the Probability Simplex
04/24 Radu Balan (UMD),   MDL based Estimation of the Number of Sources in a Sparse Signals Mixture Model
05/1 No seminar
05/8 Osman Yagan (UMD),  
A Zero-one Law for Connectivity in the Random Graphs Induced by a Random Key Predistribution Scheme
 


Fall 2007

9/13 Kickoff meeting
9/20 Alexander Barg (UMD), An introductory overview of coding theory
9/27 No seminar because of Allerton conference
10/4 No seminar for no reason
10/11 Prakash Narayan (UMD), Information Theory for Beginners I
10/18 Prakash Narayan (UMD), Information Theory for Beginners II
10/25 Wei Kang (UMD), The Relay Channel
11/1 Nuno C. Martins (UMD) Entropy-power inequalities in networked control
11/8 Brooke Shrader (UMD) Feedback Capacity of the Compound Channel
11/15 Venkat Guruswami (UWA), List Decoding with Optimal Rate
11/22 Thanksgiving break
11/29 Raef Bahi Youssef (UMD) Broadcast Channels with Confidential Messages
12/6 Richard Hyong-Jun La (UMD) On the Scalability of Cooperative Time Synchronization in Pulse-connected Networks
12/13 Vladimir Blinovsky (Universit\E4t Bielefeld) About Convexity of One Function from Coding Theory
 


Spring 2007

2/07 Arya Mazumdar (UMD), Interleavers in Parallel Turbo Codes (Part 1)
2/14 University closed because of snow
2/21 Arya Mazumdar (UMD), Interleavers in Parallel Turbo Codes (Part 2)
2/28 Punarbasu Purkayastha (UMD), Bounds on codes in the NRT-metric space
3/7 Wei Kang (UMD), A new data processing inequality and its applications in multi-user information theory (Part1)
3/14; 3/21, no seminars
3/28 Wei Kang (UMD), A new data processing inequality and its applications in multi-user information theory (Part2)
4/04 Ravi Tandon (UMD), Dependence balance bounds for single-output two-way channels
4/11 Nan Liu (UMD), Sending a Bi-Variate Gaussian Source over a Gaussian MAC
4/25 Prasanth Anthapadmanabhan (UMD), A Strong Converse for the "Decode-one" Multiple-Access Channel
5/02 Guang Han (UMD), Threshold of Monotone Property
5/09 Jun Chen (IBM), On the Duality Between Slepian-Wolf Coding and Channel Coding


Fall 2006

9/6  Organizational meeting
9/20  Prakash Narayan (UMD), Slepian-Wolf Data Compression and Linear Channel Codes
9/27 Alexander Barg (UMD), Two topics in error-correcting codes: Locally testable codes and the Gilbert-Varshamov bound
10/4 Nuno Martins (UMD), Coding for Additive White Noise Channels with Feedback Corrupted by Uniform Quantization or Bounded Noise
10/11 Vijay Gupta (UMD), Data Transmission over Networks for Estimation and Control
10/25 N. Prasanth Anthapadmanabhan (UMD), Capacity of binary fingerprinting with two pirates
11/1 Sirin Nitinawarat (UMD), A Graph-based Framework for Transmission of Correlated Sources over Multiple Access Channels
11/8 Armand Makowski (UMD), Geometric random graphs on the unit interval (Part I)
11/14 Rudolf Ahlswede (Universit\E4t Bielefeld), Identification Entropy
(joint with HyNet Colloquium)
12/4 Armand Makowski (UMD), Geometric random graphs on the unit interval (Part II)

12/6 Nan Liu (UMD), Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
12/13 Brooke Shrader (UMD), Fountain Codes and Fountain Capacity


Spring 2006

2/20  Damianos Karakos (JHU), Estimating Conditional Densities from Sparse Data for Statistical
Language Modeling

2/28 Achilleas Anastasopoulos (UMich/UMD), Performance analysis and decoding complexity of turbo-like codes in  noisy channels
3/7 (i) Achilleas Anastasopoulos (cont'd) (ii) Andrew Duggan (UMD) Performance bounds on the list decoding of RS codes
4/3 Time
11:30 Poorvi Vora (GWU) Related-Key Linear Cryptanalysis of Block Ciphers
4/10 Andrew Duggan (UMD) Correcting Errors Beyond the Guruswami-Sudan Radius
(and the Johnson Bound) in Poynomial Time
4/17 Pascal Vontobel (MIT) Graph-Cover Decoding: Connecting Iterative Decoding and Linear
Programming Decoding

4/24 Sirin Nitinawarat (UMD) Secret Key Generation for Correlated Gaussian Sources
5/
8 Ahmed Sadek (UMD) Impact of Cooperation at the MAC Layer



Fall 2005

9/19 AVW 2168, A. Barg (UMD), The error exponent for "dirty paper coding"
9/26 Raymond Yeung (CU HongKong), Network Coding
10/3
AVW 3258, Ahmed Sadek (UMD), Diversity-Multiplexing Tradeoff
10/10 Sirin Nitinawarat (UMD), Weight Distribution of LDPC Codes (References: 1 2 3 4)
10/17
AVW 3258, Ahmed Sadek (UMD), Diversity-Multiplexing Tradeoff (Contd...)
10/24 Alexander Barg (UMD), A linear-algebraic approach to linear programming bounds of coding theory
10/31 Alkan Soysal (UMD), Duality of Gaussian multiple-access and broadcast channels
11/7  N. Prasanth Anthapadmanabhan (UMD), Linear network coding
11/14 Shabnam Shafiee (UMD), Compression of encrypted data
11/21 Punarbasu Purkayastha (UMD), Nested linear/lattice codes for structured multiterminal binning
11/28 Karim Seddik (UMD), Cooperative strategies and capacity theorems for relay networks
12/5 
No seminar
12/12 Andrew Duggan (UMD), Communicating via a Processing Broadcast Satellite;

Ahmed Ibrahim (UMD),  Duality Between Source Coding and Channel Coding and its Extension to the Side Information Case
12/19 Wei Kang & Nan Liu (UMD), Capacity Region of Gaussian MIMO Broadcast Channel
(last meeting for this semester)


Spring 2005

2/2 Grigory Kabatiansky (IPPI, Moscow), Collusion secure digital fingerprinting: the case of two pirates revisited
2/9 Adrian Papamarcou (UMD), Writing on Dirty Paper: A Geometrical Approach

2/16 Jon Feldman (Columbia U.), Linear programming decoding
2/23 No seminar
(to avoid conflict with the talk on quantum information science, 3:30pm, CSIC 1115)
3/2 AVW2460, 3:00-4:00 (Note an unusual room) (Joint with CSPL seminar)
   Olgica Milenkovic (U. Colorado, Boulder), Constrained and Error-Control Coding for DNA Computers

3/9 Damianos Karakos (Johns Hopkins), An Introduction to Decision Trees
3/16 No seminar
(CISS Conference, JHU)
3/23 Spring break
4/1 Tom Richardson (Flarion Technologies), Design and Modeling Issues for Mobile Wireless Data: An introduction to Flash OFDM (CSHCN Colloquium)
4/6 Alexander Barg (UMD), Quantum Codes: An Introduction
4/13 Alexander Barg (UMD), Quantum Codes: An Introduction
(continued)
4/20 Punarbasu Purkayastha (UMD), Weight distribution of LDPC codes
4/27 Prakash Narayan (UMD), The Minimum Description Length (MDL) Principle (Reference [1] in pdf) 5/4 Martin Wainwright (UC Berkeley) (joint with CSPL seminar), Tree-reweighted message-passing algorithms in graphical models: Some theory and applications
5/12 Pierre Moulin (UIUC) (CSPL seminar, note the unusual day), Communication games with side information


Fall 2004

12/15 Prof. Prakash Narayan (UMD), Throughput-Delay Trade-off in Wireless Networks
References:
A. El Gamal, J. Mammen, B. Prabhakar and D. Shah, Throughput-Delay Trade-off in Wireless Networks, in IEEE INFOCOM, Hong Kong, 2004.(Best Paper Award)

12/08 Alkan Soysal (UMD), Network Coding
References:
a. R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, "Network information flow," IEEE Trans. on Information Theory, vol. 46, pp. 1204-1216, 2000.
b. S.-Y. R. Li, R. W. Yeung, and N. Cai. "Linear network coding". IEEE Transactions on Information Theory , Februray, 2003.
11/17 Prof. Min Wu and Shan He (UMD), Joint Coding and Embedding Techniques for Multimedia Fingerprinting
Abstract:
Digital fingerprinting is an emerging technology to protect multimedia content from illegal redistribution by uniquely marking copies of the content distributed to each user. Collusion is a powerful attack whereby several differently fingerprinted copies of the same content are combined together to attenuate or even remove the embedded fingerprints. One of the main categories of collusion resistant fingerprinting techniques is coded fingerprinting, which uses compact codes to represent users. Many existing works in this area focus on the code layer and usually do not evaluate the overall performance with the embedding layer.
In this talk, we first review the techniques of robust data embedding, which serves as a basis for putting digital fingerprints (both non-coded and coded) into multimedia signals. From multimedia signal processing perspective, assigning and embedding mutually orthogonal signals as fingerprints to represent each of the users is a natural way to perform fingerprinting. Using this well-studied orthogonal fingerprinting as a baseline, we examine the overall performance of the error correcting code (ECC) based fingerprinting, including both the coding and embedding layers. The results suggest that when compared to the non-coded orthogonal approach for the same number of users and the same host signal length, the ECC fingerprinting has computational advantage and supports efficient distribution, but has in general a lower collusion resistance by one order of magnitude. We also observe very different resistance of ECC fingerprints against averaging and interleaving types of collusion. These observations have motivated us to propose two new techniques to improve the collusion resistance of coded fingerprinting while retaining its advantages. The improvement is benefited from the joint consideration of the coding and embedding layers, and is validated by the experimental results on both synthetic data and real images.

11/03 Onur Kaya and Nan Liu (UMD), Diversity-Multiplexing Tradeoff (Contd...)
10/27 Onur Kaya and Nan Liu (UMD), Diversity-Multiplexing Tradeoff
References:
[1] L. Zheng and D. Tse, "Diversity and Multiplexing: A Fundamental Tradeoff in Multiple Antenna Channels'', IEEE Transactions on Information Theory, vol. 49(5), May 2003.2
[2] D. Tse, P. Viswanath and L. Zheng, "Diversity-Multiplexing Tradeoff in Multiple Access Channels" , to appear in the Transactions on Information Theory. (Revised: March 2004).
[3] H. El Gamal, G. Caire, M. Oussama Damen, "Lattice Coding and Decoding Achieve the Optimal Diversity-Multiplexing Tradeoff of MIMO Channels", IEEE Transactions on Information Theory 50(6): 968-985 (2004)


10/20 J. Justesen (TU Denmark), Decoding more errors in Reed Solomon codes
Abstract: Standard decoding algorithms for RS codes usually lead to decoding failure when more than D/2 errors occur, while decoding errors are very rare. When RS codes are used in various forms of concatenated codes, it is desirable to correct more errors, and often additional information is available from the inner code. In the talk I will consider some recent advances in RS decoding and their potential for improving decoder performance.
10/12 No seminar
10/5 N. Prasanth Anthapadmanabhan (UMD)Optimal Probabilistic Fingerprint Codes
9/28 No seminar due to Allerton conference.
9/21 Chunxuan Ye (UMD) The private key capacity region for three terminals (joint work with P. Narayan)
9/14 Kaushik Chakraborty (UMD), Capacity of the Optical Fading Channel with Channel State Information


Spring 2004

3/24 A. Barg (UMD), Codes from bipartite graphs
3/31 A. Barg (UMD), Bounding the error probability via the distance distribution of codes
4/7 No seminar
4/14 P. Narayan (UMD), Secret key generation and Slepian-Wolf data compression
4/21 Damianos Karakos (JHU), EM algorithm and its connection with alternating minimization technique of Csiszar and Tusnady
4/28 N. Prasanth Anthapadmanabhan and Kaushik Chakraborthy (UMD), Mutual Information and MMSE in Gaussian Channels (Guo-Shamai-Verdu '04)
5/5 Vinay Chande (UMD), Exponential Error bounds for Erasure, List and Decision Feedback Schemes (Forney '68)