Hola,
¿eres nuevo aquí?

Registrate y conecta tu empresa con financiación pública, partners y proyectos.

ACCENT

Financiado

Algebraic Covering Codes Enabling Network Transmissions

Applications of rank-metric codes arise ever more frequently in network communications problems, and yet their mathematical theory is still in its infancy. To date attention has almost exclusively focussed on very special classes... ver más

30/04/2020

NUID UCD

176K€

Presupuesto del proyecto: 176K€

Líder del proyecto

UNIVERSITY COLLEGE DUBLIN NATIONAL UNIVERSITY... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2020-04-30

Línea de financiación objetivo El proyecto se financió a través de la siguiente ayuda:

MSCA-IF-2016: Individual Fellowships

I+D

Cerrada hace 8 años

0% 100%

2 Participantes

NUID UCD

175.87K€ | Lider

FABRIC CREATIONS

319.40K€ | Participante

Proyectos interesantes

MTM2014-60127-P TECNICAS DE OPTIMIZACION EN TEORIA DE GRAFOS, GRUPOS Y COMBI... 224K€ Cerrado

MTM2008-06620-C03-01 PROBLEMAS EXTREMALES Y DE OPTIMIZACION EN TEORIA DE GRAFOS Y... 180K€ Cerrado

RAND-COMB-DESIGN Random Combinatorial Designs 165K€ Cerrado

MTM2015-67304-P ESTIMACION DE REDES LATENTES 53K€ Cerrado

BES-2013-065297 AVANCES EN APRENDIZAJE ESTADISTICO, COMUNICACIONES Y TEORIA... 43K€ Cerrado

MTM2008-05866-C03-01 OPTIMIZACION DE REDES DE INTERCONEXION 115K€ Cerrado

Últimas noticias

27-11-2024: Videojuegos y creaci... Se abre la línea de ayuda pública: Ayudas para la promoción del sector del videojuego, del pódcast y otras formas de creación digital

27-11-2024: DGIPYME En las últimas 48 horas el Organismo DGIPYME ha otorgado 1 concesiones

27-11-2024: FUNDACION-EOI En las últimas 48 horas el Organismo FUNDACION EOI ha otorgado 2 concesiones

Duración del proyecto: 37 meses Fecha Inicio: 2017-03-16
Fecha Fin: 2020-04-30

Presupuesto del proyecto 176K€

Descripción del proyecto Applications of rank-metric codes arise ever more frequently in network communications problems, and yet their mathematical theory is still in its infancy. To date attention has almost exclusively focussed on very special classes of codes and their generalizations. The covering problem for rank-metric codes is largely unsolved, and is an important combinatorial research topic. For error-free paradigms, codes with low covering radius provide efficient solutions for broadcast problems, and specifically to optimizing content delivery networks for large files distribution. Current approaches to such applications are suboptimal, while known methods to obtaining best possible performance are computationally infeasible. For error-correcting schemes, the covering radius is an important indicator of code performance, as it measures the number of errors that can be corrected in network transmissions. We propose to develop a mathematical theory of covering codes for the rank metric. We will obtain bounds on the covering radius of an arbitrary rank-metric code, as well as special classes of codes. We will develop the fundamental tools required to pioneer this theory, offering scope for researchers of Algebraic Coding Theory, as well as combinatorial objects useful for Engineering applications. We will also investigate symmetric rank-metric codes, focussing on their distance distributions. These codes have a very rich combinatorial structure. The combined expertise of the Applied Algebra group at UCD, along with the methods developed by the applicant in his PhD, will propel the project to achieve its objectives. The potential scientific impact is high, given the newness and combinatorial hardness of the topic, its importance for network communications, and exponentially increasing data traffic. The impact for the applicant will be the opportunity to establish this fundamental topic, magnify his scientific profile, and consolidate/expand his professional network.

Conecta tu I+D

Entra hoy

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores