A note on the injection distance

Stanislav Bulygin; Hans Olav Geil; Diego Ruano Benito

A note on the injection distance

Stanislav Bulygin, Hans Olav Geil, Diego Ruano Benito

Institut for Matematiske Fag

Publikation: Andet › Udgivelser på nettet - Net-publikation › Forskning

Abstract

Koetter and Kschischang showed in [R. Koetter and F.R. Kschischang, "Coding for Errors and Erasures in Random Network Coding," IEEE Trans. Inform. Theory, {54(8), 2008] that the network coding counterpart of Gabidulin codes performs asymptotically optimal with respect to the subspace distance. Recently, Silva and Kschischang introduced in [D. Silva and F.R. Kschischang, "On Metrics for Error Correction in Network Coding," To appear in IEEE Trans. Inform. Theory, ArXiv: 0805.3824v4[cs.IT], 2009] the injection distance to give a detailed picture of what happens in noncoherent network coding. We show that the above codes are also asymptotically optimal with respect to this distance.

Originalsprog	Engelsk
Publikationsdato	9 dec. 2009
Status	Udgivet - 9 dec. 2009

Bibliografisk note

Senest ændret: 09/12/2009

Adgang til dokumentet

http://arxiv.org/abs/0912.1790

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@misc{65c09b787bf24c4bbadb64835b4d1f00,

title = "A note on the injection distance",

abstract = "Koetter and Kschischang showed in [R. Koetter and F.R. Kschischang, {"}Coding for Errors and Erasures in Random Network Coding,{"} IEEE Trans. Inform. Theory, {54(8), 2008] that the network coding counterpart of Gabidulin codes performs asymptotically optimal with respect to the subspace distance. Recently, Silva and Kschischang introduced in [D. Silva and F.R. Kschischang, {"}On Metrics for Error Correction in Network Coding,{"} To appear in IEEE Trans. Inform. Theory, ArXiv: 0805.3824v4[cs.IT], 2009] the injection distance to give a detailed picture of what happens in noncoherent network coding. We show that the above codes are also asymptotically optimal with respect to this distance. ",

keywords = "Information theory",

author = "Stanislav Bulygin and Geil, {Hans Olav} and {Ruano Benito}, Diego",

note = " Senest {\ae}ndret: 09/12/2009",

year = "2009",

month = dec,

day = "9",

language = "English",

type = "Other",

}

TY - ICOMM

T1 - A note on the injection distance

AU - Bulygin, Stanislav

AU - Geil, Hans Olav

AU - Ruano Benito, Diego

N1 - Senest ændret: 09/12/2009

PY - 2009/12/9

Y1 - 2009/12/9

N2 - Koetter and Kschischang showed in [R. Koetter and F.R. Kschischang, "Coding for Errors and Erasures in Random Network Coding," IEEE Trans. Inform. Theory, {54(8), 2008] that the network coding counterpart of Gabidulin codes performs asymptotically optimal with respect to the subspace distance. Recently, Silva and Kschischang introduced in [D. Silva and F.R. Kschischang, "On Metrics for Error Correction in Network Coding," To appear in IEEE Trans. Inform. Theory, ArXiv: 0805.3824v4[cs.IT], 2009] the injection distance to give a detailed picture of what happens in noncoherent network coding. We show that the above codes are also asymptotically optimal with respect to this distance.

AB - Koetter and Kschischang showed in [R. Koetter and F.R. Kschischang, "Coding for Errors and Erasures in Random Network Coding," IEEE Trans. Inform. Theory, {54(8), 2008] that the network coding counterpart of Gabidulin codes performs asymptotically optimal with respect to the subspace distance. Recently, Silva and Kschischang introduced in [D. Silva and F.R. Kschischang, "On Metrics for Error Correction in Network Coding," To appear in IEEE Trans. Inform. Theory, ArXiv: 0805.3824v4[cs.IT], 2009] the injection distance to give a detailed picture of what happens in noncoherent network coding. We show that the above codes are also asymptotically optimal with respect to this distance.

KW - Information theory

M3 - Net publication - Internet publication

ER -

A note on the injection distance

Abstract

Bibliografisk note

Adgang til dokumentet

AUB Link

Fingeraftryk

Citationsformater