|
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
Network coding
Thu 02 Sep, 14.40-16.00, Room 2
Contributed session
|
|
Alireza Keshavarz-Haddad and Mohammad A. (Amir) Khojastepour
Rotate-and-Add Coding: A Novel Algebraic Network Coding Scheme
|
|
Abstract:
In this paper we introduce a novel linear network coding scheme,
namely "rotate-and-add coding", that possesses low encoding
complexity and operates fundamentally different from the traditional
network codes. This scheme can operate on a small field (e.g.
F2), thereby, it alleviates the computational
complexities due to multiplication and addition operations in large
finite fields. The key idea is to function on a vector of symbols
instead of working with a single symbol of a large field. Each node
encodes its received vectors by simply rotationally shifting the
vectors and then adding them, i.e., here the addition is done in
vector form and the multiplication is replaced by rotation. We
verify that the new scheme requires lower computation and overhead
than the existing schemes. However, as the cost of reducing the
complexity, it provides slightly smaller throughput.
Thu 02 Sep, 14.40-15.00, Room 2
|
|
|
Theodoros K. Dikaliotis, Alexandros Dimakis, Tracey Ho, and Michelle Effros
On the Delay Advantage of Coding in Packet Erasure Networks
|
|
Abstract:
We consider the delay of network coding compared to routing for a
family of simple networks with parallel links. We investigate the
sub-linear term in the block delay required for unicasting n
packets and show that there is an unbounded gap between network
coding and routing. In particular, we show that delay benefit of
network coding is scaling at least as fast as √n. The main
technical contribution involves showing that the delay function for
the routing retransmission strategy is unbounded. This problem is
equivalent to computing the expected maximum of two negative
binomial random variables. This problem has also been addressed
previously and we derive the first exact characterization which
might be of independent interest.
Thu 02 Sep, 15.00-15.20, Room 2
|
|
|
Anna-Lena Trautmann, Felice Manganiello, and Joachim Rosenthal
Orbit Codes - A New Concept in the Area of Network Coding
|
|
Abstract:
We introduce a new class of constant dimension codes called
orbit codes. The basic properties of these codes are
derived. It will be shown that many of the known families of
constant dimension codes in the literature are actually orbit codes.
Thu 02 Sep, 15.20-15.40, Room 2
|
|
|
Tao Cui, Tracey Ho, and Jörg Kliewer
On Secure Network Coding with Unequal Link Capacities and Restricted Wiretapping Sets
|
|
Abstract:
We address secure network coding over networks with unequal link
capacities in the presence of a wiretapper who has only access to a
restricted number of k links in the network. Previous results show
that for the case of equal link capacities and unrestricted
wiretapping sets, the secrecy capacity is given by the cut-set
bound, whether or not the location of the wiretapped links is
known. The cut-set bound can be achieved by injecting k random
keys at the source which are decoded at the sink along with the
message. In contrast, for the case where the wiretapping set is
restricted, or where link capacities are not equal, we show that the
cut-set bound is not achievable in general. Finally, it is shown
that determining the secrecy capacity is a NP-hard problem.
Thu 02 Sep, 15.40-16.00, Room 2
|
Back to previous page
Return to conference mainpage
|
|
