Fundamental Properties of Sum-Rank-Metric Codes

Research output: Contribution to journalArticleAcademicpeer-review

37 Citations (Scopus)
5 Downloads (Pure)

Abstract

This paper investigates the theory of sum-rank-metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory of sum-rank-metric codes is also explored, showing that MSRD codes (the sum-rank analogue of MDS codes) dualize to MSRD codes only if all matrix blocks have the same number of columns. In the latter case, duality considerations lead to an upper bound on the number of blocks for MSRD codes. The paper also contains various constructions of sum-rank-metric codes for variable block sizes, illustrating the possible behaviours of these objects with respect to bounds, existence, and duality properties.

Original languageEnglish
Pages (from-to)6456-6475
Number of pages20
JournalIEEE Transactions on Information Theory
Volume67
Issue number10
Early online date21 Apr 2021
DOIs
Publication statusPublished - Oct 2021

Keywords

  • asymptotic bound
  • bound
  • code construction
  • duality
  • Encoding
  • Lattices
  • MacWilliams identity
  • Manganese
  • Measurement
  • MSRD code
  • Network coding
  • Reed-Solomon codes
  • sum-rank-metric code
  • Upper bound
  • Sum-rank-metric code

Fingerprint

Dive into the research topics of 'Fundamental Properties of Sum-Rank-Metric Codes'. Together they form a unique fingerprint.

Cite this