Conference paper Open Access

Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes

Mital,Nitish; Kralevska, Katina; Ling, Cong; Gunduz, Deniz


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/99b000c7-201e-4d22-b2cd-ad383c7a811b/ISIT_MBR_code.pdf"
      }, 
      "checksum": "md5:16f3a5f64d8fed1610732594f17746d8", 
      "bucket": "99b000c7-201e-4d22-b2cd-ad383c7a811b", 
      "key": "ISIT_MBR_code.pdf", 
      "type": "pdf", 
      "size": 291825
    }
  ], 
  "owners": [
    189562
  ], 
  "doi": "10.1109/ISIT.2019.8849496", 
  "stats": {
    "version_unique_downloads": 7.0, 
    "unique_views": 5.0, 
    "views": 7.0, 
    "version_views": 7.0, 
    "unique_downloads": 7.0, 
    "version_unique_views": 5.0, 
    "volume": 2626425.0, 
    "version_downloads": 9.0, 
    "downloads": 9.0, 
    "version_volume": 2626425.0
  }, 
  "links": {
    "doi": "https://doi.org/10.1109/ISIT.2019.8849496", 
    "latest_html": "https://zenodo.org/record/4452159", 
    "bucket": "https://zenodo.org/api/files/99b000c7-201e-4d22-b2cd-ad383c7a811b", 
    "badge": "https://zenodo.org/badge/doi/10.1109/ISIT.2019.8849496.svg", 
    "html": "https://zenodo.org/record/4452159", 
    "latest": "https://zenodo.org/api/records/4452159"
  }, 
  "created": "2021-01-20T11:32:18.667202+00:00", 
  "updated": "2021-01-20T12:27:10.979251+00:00", 
  "conceptrecid": "4452158", 
  "revision": 3, 
  "id": 4452159, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.1109/ISIT.2019.8849496", 
    "description": "<p>A code construction and repair scheme for optimal functional regeneration of multiple node failures is presented, which is based on stitching together short MDS codes on carefully chosen sets of points lying on a linearized polynomial. The nodes are connected wirelessly, hence all transmissions by helper nodes during a repair round are available to all the nodes being repaired. The scheme is simple and practical because of low subpacketization, low I/O cost and low computational cost. Achievability of the minimum-bandwidth regenerating (MBR) point, as well as an interior point, on the optimal storage-repair bandwidth tradeoff curve is shown. The subspace properties derived in the paper provide insight into the general properties of functional regenerating codes.</p>", 
    "license": {
      "id": "CC-BY-4.0"
    }, 
    "title": "Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "4452158"
          }, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "4452159"
          }
        }
      ]
    }, 
    "grants": [
      {
        "code": "675891", 
        "links": {
          "self": "https://zenodo.org/api/grants/10.13039/501100000780::675891"
        }, 
        "title": "Sustainable CellulAr networks harVEstiNG ambient Energy", 
        "acronym": "SCAVENGE", 
        "program": "H2020", 
        "funder": {
          "doi": "10.13039/501100000780", 
          "acronyms": [], 
          "name": "European Commission", 
          "links": {
            "self": "https://zenodo.org/api/funders/10.13039/501100000780"
          }
        }
      }
    ], 
    "publication_date": "2019-07-07", 
    "creators": [
      {
        "affiliation": "Imperial College London", 
        "name": "Mital,Nitish"
      }, 
      {
        "affiliation": "Norwegian University of Science and Technology", 
        "name": "Kralevska, Katina"
      }, 
      {
        "affiliation": "Imperial College London", 
        "name": "Ling, Cong"
      }, 
      {
        "affiliation": "Imperial College London", 
        "name": "Gunduz, Deniz"
      }
    ], 
    "access_right": "open", 
    "resource_type": {
      "subtype": "conferencepaper", 
      "type": "publication", 
      "title": "Conference paper"
    }
  }
}
7
9
views
downloads
Views 7
Downloads 9
Data volume 2.6 MB
Unique views 5
Unique downloads 7

Share

Cite as