The geometry of covering codes in the sum-rank metric

Matteo Bonini, Martino Borello, Eimear Byrne

Publikation: Working paper/PreprintPreprint

17 Downloads (Pure)

Abstract

We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems of a fixed dimension, which is equivalent to the covering problem in the sum-rank metric. We obtain upper and lower bounds on this quantity. We also give constructions of saturating systems arising from geometrical structures.
OriginalsprogEngelsk
UdgiverarXiv
Antal sider12
DOI
StatusUdgivet - 16 okt. 2024

Emneord

  • math.CO
  • cs.IT
  • math.IT
  • 05B40, 11T71, 51E20, 52C17, 94B75

Fingeraftryk

Dyk ned i forskningsemnerne om 'The geometry of covering codes in the sum-rank metric'. Sammen danner de et unikt fingeraftryk.

Citationsformater