1 Ocak 2021 Dergi makalesi Açık Erişim

Borello, Martino; Guneri, Cem; Sacikara, Elif; Sole, Patrick

JSON

{
  "conceptrecid": "236915", 
  "created": "2022-10-07T09:47:20.615908+00:00", 
  "doi": "10.1007/s10623-021-00921-4", 
  "files": [
    {
      "bucket": "191339d2-ff51-4d92-b08e-a98b62a5982c", 
      "checksum": "md5:b25b4f269b3675a0e4f775e3370d37ee", 
      "key": "bib-9df979e1-5273-41f9-9fd2-efce73da6975.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/191339d2-ff51-4d92-b08e-a98b62a5982c/bib-9df979e1-5273-41f9-9fd2-efce73da6975.txt"
      }, 
      "size": 139, 
      "type": "txt"
    }
  ], 
  "id": 236916, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1007/s10623-021-00921-4.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/191339d2-ff51-4d92-b08e-a98b62a5982c", 
    "doi": "https://doi.org/10.1007/s10623-021-00921-4", 
    "html": "https://aperta.ulakbim.gov.tr/record/236916", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/236916", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/236916"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Univ Paris 08, Univ Sorbonne Paris Nord, CNRS, UMR 7539,Lab Geometrie Analyse & Applicat,LAGA, F-93430 Villetaneuse, France", 
        "name": "Borello, Martino"
      }, 
      {
        "affiliation": "Sabanci Univ, Fac Engn & Nat Sci, TR-34956 Istanbul, Turkey", 
        "name": "Guneri, Cem"
      }, 
      {
        "affiliation": "Univ Zurich, Inst Math, Zurich, Switzerland", 
        "name": "Sacikara, Elif"
      }, 
      {
        "affiliation": "Aix Marseille Univ, CNRS, Ctr Marseille, I2M, Marseille, France", 
        "name": "Sole, Patrick"
      }
    ], 
    "description": "The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in Jitman and Ling (Des Codes Cryptogr 74:511-531, 2015), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling and Sole in IEEE Trans Inf Theory 47:2751-2760, 2001). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases. In addition, examples of large strictly quasi-abelian codes of about a half rate are given. The concatenated structure also enables us to conclude that strictly quasi-abelian linear complementary dual codes over any finite field are asymptotically good.", 
    "doi": "10.1007/s10623-021-00921-4", 
    "has_grant": false, 
    "journal": {
      "title": "DESIGNS CODES AND CRYPTOGRAPHY"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2021-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "236916"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "236915"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "science_branches": [
      "Di\u011fer"
    ], 
    "title": "The concatenated structure of quasi-abelian codes"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 10.0, 
    "unique_downloads": 10.0, 
    "unique_views": 42.0, 
    "version_downloads": 10.0, 
    "version_unique_downloads": 10.0, 
    "version_unique_views": 42.0, 
    "version_views": 45.0, 
    "version_volume": 1390.0, 
    "views": 45.0, 
    "volume": 1390.0
  }, 
  "updated": "2022-10-07T09:47:20.670397+00:00"
}