ECE ILLINOIS Facebook ECE ILLINOIS on Twitter ECE ILLINOIS Alumni and Friends on LinkedIn ECE ILLINOIS Instagram

December 2014

  S M T W T F S
> 30 1 2 3 4 5 6
> 7 8 9 10 11 12 13
> 14 15 16 17 18 19 20
> 21 22 23 24 25 26 27
> 28 29 30 31 1 2 3

Advanced Search

Add this event to my calendar

COMM SPECIAL Seminar - “A Generalized sphere-packing upper bounds on the size of codes for combinatorial channels”

Speaker Negar Kiyavash, Assistant Professor
Date: 3/20/2014
Time: 4:00 pm
Location: 141 Coordinated Science Lab
Event Contact: Denise Lewis
Sponsor: Coordinated Science Lab
  **Abstract** We discuss some recent improvements on bounds on optimal code size for some non symmetric channels such as deletion/insertion channel. We show that in essence such bounds may be thought of as generalized sphere-packing upper bounds derived either for the channel graph or codeword constraint graph of the channel. ****Bio**** Negar Kiyavash has been an Assistant Professor in the Industrial and Enterprise Engineering Department and a Research Assistant Professor in the Coordinated Science Laboratory at the University of Illinois at Urbana-Champaign since 2009. She received her Ph.D. degree in electrical and computer engineering from the University of Illinois at Urbana-Champaign in 2006. From 2006 to 2008, she was Research Faculty in the Department of Computer Science and a Research Scientist in the Information Trust Institute at Illinois. Her research interests are in statistical signal processing and information theory with applications to the design and analysis of algorithms for network inference and security. She is a recipient of NSF CAREER and AFOSR YIP awards and the Illinois College of Engineering Dean's Award for Excellence in Research.