Please use this identifier to cite or link to this item:
http://dspace.ucuenca.edu.ec/handle/123456789/31929
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Palacio Baus, Kenneth Samuel | - |
dc.date.accessioned | 2019-02-06T16:31:33Z | - |
dc.date.available | 2019-02-06T16:31:33Z | - |
dc.date.issued | 2018 | - |
dc.identifier.isbn | 978-153864780-6 | - |
dc.identifier.issn | 2157-8095 | - |
dc.identifier.uri | http://dspace.ucuenca.edu.ec/handle/123456789/31929 | - |
dc.identifier.uri | https://www.scopus.com/record/display.uri?eid=2-s2.0-85052438684&doi=10.1109%2fISIT.2018.8437657&origin=inward&txGid=54e86b55e00627408a2d18d0d4234f34 | - |
dc.description | A primitive relay channel (PRC) has one source (S) communicating a message to one destination (D) with the help of a relay (R). The link between R and D is considered to be noiseless, of finite capacity, and parallel to the link between S and (R,D). Prior work has established, for any fixed number of channel uses, the minimal R-D link rate needed so that the overall S-D message rate equals the zero-error single-input multiple output outer bound (Problem 1). The zero-error relaying scheme was expressed as a coloring of a carefully defined 'relaying compression graph'. It is shown here that this relaying compression graph for n channel uses is not obtained as a strong product from its n = 1 instance. Here we define a new graph, the 'primitive relaying graph' and a new 'special strong product' such that the n-channel use primitive relaying graph corresponds to the n-fold special strong product of the n = 1 graph. We show how the solution to Problem 1 can be obtained from this new primitive relaying graph directly. Further study of this primitive relaying graph has the potential to highlight the structure of optimal codes for zero-error relaying. © 2018 IEEE. | - |
dc.description.abstract | A primitive relay channel (PRC) has one source (S) communicating a message to one destination (D) with the help of a relay (R). The link between R and D is considered to be noiseless, of finite capacity, and parallel to the link between S and (R,D). Prior work has established, for any fixed number of channel uses, the minimal R-D link rate needed so that the overall S-D message rate equals the zero-error single-input multiple output outer bound (Problem 1). The zero-error relaying scheme was expressed as a coloring of a carefully defined 'relaying compression graph'. It is shown here that this relaying compression graph for n channel uses is not obtained as a strong product from its n = 1 instance. Here we define a new graph, the 'primitive relaying graph' and a new 'special strong product' such that the n-channel use primitive relaying graph corresponds to the n-fold special strong product of the n = 1 graph. We show how the solution to Problem 1 can be obtained from this new primitive relaying graph directly. Further study of this primitive relaying graph has the potential to highlight the structure of optimal codes for zero-error relaying. © 2018 IEEE. | - |
dc.language.iso | es_ES | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.source | IEEE International Symposium on Information Theory - Proceedings | - |
dc.subject | Zero-Error Problems | - |
dc.subject | Zero-Error Relaying Scheme | - |
dc.subject | Primitive Relaying Graph | - |
dc.subject | Relaying Compression Graph | - |
dc.title | a relaying graph and special strong product for zero-error problems in primitive relay channels | - |
dc.type | ARTÍCULO DE CONFERENCIA | - |
dc.description.city | Colorado | - |
dc.ucuenca.idautor | 0103566360 | - |
dc.identifier.doi | 10.1109/ISIT.2018.8437657 | - |
dc.ucuenca.embargoend | 2050-12-31 | - |
dc.ucuenca.version | Versión publicada | - |
dc.ucuenca.embargointerno | 2050-12-31 | - |
dc.ucuenca.areaconocimientounescoamplio | 07 - Ingeniería, Industria y Construcción | - |
dc.ucuenca.afiliacion | Palacio, K., Universidad de Cuenca, Cuenca, Ecuador | - |
dc.ucuenca.correspondencia | Palacio Baus, Kenneth Samuel, kpalac2@uic.edu | - |
dc.ucuenca.volumen | volumen 2018-June | - |
dc.ucuenca.indicebibliografico | SCOPUS | - |
dc.ucuenca.numerocitaciones | 0 | - |
dc.ucuenca.areaconocimientofrascatiamplio | 2. Ingeniería y Tecnología | - |
dc.ucuenca.pais | ESTADOS UNIDOS | - |
dc.ucuenca.conferencia | 2018 IEEE International Symposium on Information Theory, ISIT 2018 | - |
dc.ucuenca.areaconocimientofrascatiespecifico | 2.2 Ingenierias Eléctrica, Electrónica e Información | - |
dc.ucuenca.areaconocimientofrascatidetallado | 2.2.1 Ingeniería Eléctrica y Electrónica | - |
dc.ucuenca.areaconocimientounescoespecifico | 071 - Ingeniería y Profesiones Afines | - |
dc.ucuenca.areaconocimientounescodetallado | 0714 - Electrónica y Automatización | - |
dc.ucuenca.fechainicioconferencia | 2018-06-17 | - |
dc.ucuenca.fechafinconferencia | 2018-06-22 | - |
dc.ucuenca.organizadorconferencia | Ruediger L Urbanke (EPFL, Switzerland) | - |
dc.ucuenca.comiteorganizadorconferencia | Mahesh K Varanasi (University of Colorado, USA) | - |
dc.ucuenca.urifuente | https://ieeexplore.ieee.org/document/8437657/keywords#keywords | - |
dc.contributor.ponente | Palacio Baus, Kenneth Samuel | - |
Appears in Collections: | Artículos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
documento.pdf Until 2050-12-31 | document | 606.77 kB | Adobe PDF | View/Open Request a copy |
This item is protected by original copyright |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Centro de Documentacion Regional "Juan Bautista Vázquez" | ||||||||||
|