|
Contact:
Marcus Greferath
School of Math. Sciences
University College Dublin
Belfield, Dublin 4, Ireland
Phone:
+353-1-716-2588 (UCD)
+353-85-153-0951 (mobile)
Joachim Rosenthal
Institut of Mathematics
University of Zurich
Winterthurerstrasse 190
8057 Zurich, Switzerland
Phone:
+41-44-63 55884 (office)
|
|
ITW 2010 Dublin
IEEE Information Theory Workshop
Dublin, August 30 - September 3, 2010
Keynote Talks
Invited Sessions
Contributed Sessions
Technical Program
Keynote Talks
|
|
Ian Blake
University of British Columbia |
Abelian varieties in coding and
cryptography
Abstract: Algebraic
curves over a finite field have played a
central role in both coding theory and
cryptography over the past three decades.
In coding theory the use of algebraic
curves led to the discovery of
asymptotically good codes whose parameters
lie above the Varshamov-Gilbert bound in
certain cases while in cryptography the
use of elliptic curves led to public key
cryptosystems that are more efficient, in
some sense, for a given level of security
than number based ones. It would seem
natural that the use of higher dimensional
varieties might lead to even better
results for both applications. Such has
not so far been the case. The purpose of
this talk is to discuss the situation on
the use of Abelian varieties in these two
areas.
Mon 30 Aug, 09.00-09.50, Room 1
|
|
|
Erdal Arikan
Bilkent University |
A historical account of polar
coding
Abstract: Polar coding is a
technique for constructing provably
capacity-achieving codes with low encoding
and decoding complexity. Historically,
polar coding has been developed as an
extension of efforts to enhance the channel
cutoff rate parameter. However, in its
finished form, polar coding is usually
presented without mentioning the underlying
ideas that motivated it. The goal of this
paper is to present polar coding in a
historical context, showing the logical
links in its development.
Tue 31 Aug, 09.00-09.50, Room 1
|
|
|
Tali Kaufman
MIT |
Local computation in codes
Abstract: A locally testable code allows one
to store vast amounts of data, where
estimating the fraction of errors in the
data takes roughly as much time as takes to
read one bit of the data! If the fraction of
errors is below a certain threshold, a
locally decodable code would allow one to
recover every bit of the original message,
again, in time which is roughly the time to
read one bit of the data.
Are such locally testable/decodable codes of
constant rate possible? So far we don't
know, but surprisingly-good codes are
known. In this talk I will survey some of
the literature and discuss a connection
between these notions to symmetric LDPC
codes.
Wed 01 Sep, 09.00-09.50, Room 1
|
|
|
Ueli Maurer
ETH Zurich |
A Cryptographic Theory of System
Indistinguishability
The
indistinguishability of discrete
interactive systems is a crucial concept
in cryptography (and beyond). We give an
overview of several elements of a general
theory of systems and their
indistinguishability. We define the
mathematical object corresponding to a
system, show examples of cryptographic
security proofs, and demonstrate recent
results on the security amplification of
cryptographic schemes. The talk is based
on some recent papers for which coauthors
include Krzysztof Pietrzak, Renato Renner,
and Stefano Tessaro.
Thu 02 Sep, 09.00-09.50, Room 1
|
|
|
Christine Bachoc
University of Bordeaux |
Applications of Semidefinite Programming
to Coding Theory
Abstract: We
survey recent generalizations and
improvements of the linear programming
method that involve semidefinite
programming. A general framework using
group representations and tools from graph
theory is provided.
Fri 03 Sep, 09.00-09.50, Room 1
|
Invited Sessions
|
Coding and information-theoretic methods in cryptography
Organizer: Gerard Cohen |
|
Mon 30 Aug, 09.55-12.45, Room 1
Abstracts
|
|
|
Polar codes
Organizer: Emre Telatar | |
Tue 31 Aug, 09.55-12.45, Room 1
Abstracts
|
|
|
LDPC codes
Organizers: David Burshtein and Simon Litsyn |
|
Wed 01 Sep, 09.55-12.45, Room 1
Abstracts
|
|
|
Algebraic codes and sequences
Organizer: Patrick Sole |
|
Thu 02 Sep, 09.55-12.45, Room 1
Abstracts
|
|
|
Quantum information processing
Organizer: Jean-Pierre Tillich |
|
Thu 02 Sep, 14.45-17.35, Room 1
Abstracts
|
|
|
Channel uncertainty
Organizers: Navin Kashyap and Michael Langberg |
|
Part I: Point-to-Point Communication
Fri 03 Sep, 09.55-11.35, Room 1
Abstracts
Part II: Network Communication and Coding
Fri 03 Sep, 11.50-13.05, Room 1
Abstracts
|
Contributed Sessions
|
Cooperation and throughput in networks
|
|
Mon 30 Aug, 11.30-12.50, Room 2
Abstracts
|
|
|
Low-density codes
|
|
Mon 30 Aug, 14.40-16.00, Room 1
Abstracts
|
|
|
Communication with secrecy constraints
|
|
Mon 30 Aug, 14.40-16.00, Room 2
Abstracts
|
|
|
Communication theory 1
|
|
Mon 30 Aug, 14.40-16.00, Room 3
Abstracts
|
|
|
Coding for memories
|
|
Mon 30 Aug, 16.20-17.40, Room 1
Abstracts
|
|
|
Communication with multiple antennas
|
|
Mon 30 Aug, 16.20-18.00, Room 2
Abstracts
|
|
|
Secure communication
|
|
Mon 30 Aug, 16.20-17.40, Room 3
Abstracts
|
|
|
Polar and LDPC codes
|
|
Tue 31 Aug, 14.40-15.40, Room 1
Abstracts
|
|
|
Communication theory 2
|
|
Tue 31 Aug, 14.40-16.00, Room 2
Abstracts
|
|
|
Algebraic codes
|
|
Tue 31 Aug, 14.40-16.00, Room 3
Abstracts
|
|
|
Graphical models and decoding
|
|
Tue 31 Aug, 16.20-18.00, Room 1
Abstracts
|
|
|
Coding and decoding
|
|
Tue 31 Aug, 16.20-17.40, Room 2
Abstracts
|
|
|
Interference channels
|
|
Tue 31 Aug, 16.20-18.00, Room 3
Abstracts
|
|
|
Wireless networks
|
|
Wed 01 Sep, 11.05-12.25, Room 2
Abstracts
|
|
|
Estimation and portfolio theory
|
|
Thu 02 Sep, 09.55-11.15, Room 2
Abstracts
|
|
|
Information theoretic methods
|
|
Thu 02 Sep, 11.30-12.50, Room 2
Abstracts
|
|
|
Network coding
|
|
Thu 02 Sep, 14.40-16.00, Room 2
Abstracts
|
|
|
Coding and capacity of networks
|
|
Thu 02 Sep, 16.20-17.40, Room 2
Abstracts
|
Return to conference mainpage
|
|
