Opendata, web and dolomites

ACCENT TERMINATED

Algebraic Covering Codes Enabling Network Transmissions

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "ACCENT" data sheet

The following table provides information about the project.

Coordinator
UNIVERSITY COLLEGE DUBLIN, NATIONAL UNIVERSITY OF IRELAND, DUBLIN 

Organization address
address: BELFIELD
city: DUBLIN
postcode: 4
website: www.ucd.ie

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Ireland [IE]
 Total cost 175˙866 €
 EC max contribution 175˙866 € (100%)
 Programme 1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility)
 Code Call H2020-MSCA-IF-2016
 Funding Scheme MSCA-IF-EF-ST
 Starting year 2018
 Duration (year-month-day) from 2018-05-01   to  2020-04-30

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    UNIVERSITY COLLEGE DUBLIN, NATIONAL UNIVERSITY OF IRELAND, DUBLIN IE (DUBLIN) coordinator 175˙866.00

Map

 Project objective

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.

 Publications

year authors and title journal last update
List of publications.
2020 Eimear Byrne, Alberto Ravagnani
Partition-balanced families of codes and asymptotic enumeration in coding theory
published pages: 105169, ISSN: 0097-3165, DOI: 10.1016/j.jcta.2019.105169
Journal of Combinatorial Theory, Series A 171 2020-02-04
2019 Eimear Byrne, Alessandro Neri, Alberto Ravagnani, John Sheekey
Tensor Representation of Rank-Metric Codes
published pages: 614-643, ISSN: 2470-6566, DOI: 10.1137/19m1253964
SIAM Journal on Applied Algebra and Geometry 3/4 2020-02-04
2018 Eimear Byrne, Alberto Ravagnani
Matrix Codes with the Rank Metric and Their Covering Radii
published pages: , ISSN: , DOI:
MTNS 2018 2020-02-04
2019 Eimear Byrne, Alberto Ravagnani
On the Sparsity of MRD Codes
published pages: , ISSN: , DOI:
WCC 2019 2020-02-04
2018 Elisa Gorla, Relinde Jurrius, Hiram H. López, Alberto Ravagnani
Rank-metric codes and q-polymatroids
published pages: , ISSN: 0925-9899, DOI: 10.1007/s10801-019-00889-4
Journal of Algebraic Combinatorics 2020-02-04
2019 Eimear Byrne, Alberto Ravagnani
An Assmus--Mattson Theorem for Rank Metric Codes
published pages: 1242-1260, ISSN: 0895-4801, DOI: 10.1137/18m119183x
SIAM Journal on Discrete Mathematics 33/3 2020-02-04

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "ACCENT" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "ACCENT" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.3.2.)

ACES (2019)

Antarctic Cyclones: Expression in Sea Ice

Read More  

OSeaIce (2019)

Two-way interactions between ocean heat transport and Arctic sea ice

Read More  

PROSPER (2019)

Politics of Rulemaking, Orchestration of Standards, and Private Economic Regulations

Read More