Главная

Danilo Silva

  1. On the Capacity of Multiplicative Finite-Field Matrix Channels.

    Ср, 06/01/2011 - 15:01 — SomNambul
    Authors: Danilo Silva, Bartolomeu F. Uchoa-Filho, Roberto W. Nobrega
    Subjects: Information Theory
    Abstract

    This paper deals with the multiplicative finite-field matrix channel, a
    discrete memoryless channel whose input and output are matrices (over a finite
    field) related by a multiplicative transfer matrix. Our model allows this
    transfer matrix to have any rank, while assuming that all transfer matrices
    with the same rank are equiprobable. While in general the capacity cannot be
    obtained in closed form, we provide a simplification of the problem (from
    $q^{nm}$ to O(n) variables) which allows for easy numerical computation.

  2. Network Codes Resilient to Jamming and Eavesdropping.

    Пт, 01/22/2010 - 16:01 — SomNambul
    Authors: Danilo Silva, Hongyi Yao, Sidharth Jaggi, Michael Langberg
    Subjects: Networking and Internet Architecture
    Abstract

    We consider the problem of communicating information over a network secretly
    and reliably in the presence of a hidden adversary who can eavesdrop and inject
    malicious errors. We provide polynomial-time, rate-optimal distributed network
    codes for this scenario, improving on the rates achievable in previous work.

  3. Universal Secure Error-Correcting Schemes for Network Coding.

    Ср, 01/20/2010 - 16:01 — SomNambul
    Authors: Danilo Silva, Frank R. Kschischang
    Subjects: Information Theory
    Abstract

    This paper considers the problem of securing a linear network coding system
    against an adversary that is both an eavesdropper and a jammer. The network is
    assumed to transport n packets from source to each receiver, and the adversary
    is allowed to eavesdrop on \mu arbitrarily chosen links and also to inject up
    to t erroneous packets into the network. The goal of the system is to achieve
    zero-error communication that is information-theoretically secure from the
    adversary.

  4. Communication over Finite-Field Matrix Channels.

    Пнд, 09/14/2009 - 09:02 — SomNambul
    Authors: Danilo Silva, Frank R. Kschischang, Ralf Kötter
    Subjects: Information Theory
    Abstract

    This paper is motivated by the problem of error control in network coding
    when errors are introduced in a random fashion (rather than chosen by an
    adversary). An additive-multiplicative matrix channel is considered as a model
    for random network coding. The model assumes that n packets of length m are
    transmitted over the network, and up to t erroneous packets are randomly chosen
    and injected into the network. Upper and lower bounds on capacity are obtained
    for any channel parameters, and asymptotic expressions are provided in the
    limit of large field or matrix size.

  5. On Metrics for Error Correction in Network Coding.

    Пнд, 08/31/2009 - 17:16 — SomNambul
    Authors: Danilo Silva, Frank R. Kschischang
    Subjects: Information Theory
    Abstract

    The problem of error correction in both coherent and noncoherent network
    coding is considered under an adversarial model. For coherent network coding,
    where knowledge of the network topology and network code is assumed at the
    source and destination nodes, the error correction capability of an (outer)
    code is succinctly described by the rank metric; as a consequence, it is shown
    that universal network error correcting codes achieving the Singleton bound can
    be easily constructed and efficiently decoded.

Math-arch

RSS-материал