Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding

Hannes Bartz, Sven Puchinger

Research output: Contribution to journalArticlepeer-review


Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65(8):4785–4803, 2019) proposed lifted linearized Reed–Solomon codes as suitable codes for error control in multishot network coding. We show how to construct and decode lifted interleaved linearized Reed–Solomon (LILRS) codes. Compared to the construction by Martínez-Peñas–Kschischang, interleaving allows to increase the decoding region significantly and decreases the overhead due to the lifting (i.e., increases the code rate), at the cost of an increased packet size. We propose two decoding schemes for LILRS that are both capable of correcting insertions and deletions beyond half the minimum distance of the code by either allowing a list or a small decoding failure probability. We propose a probabilistic unique Loidreau–Overbeck-like decoder for LILRS codes and an efficient interpolation-based decoding scheme that can be either used as a list decoder (with exponential worst-case list size) or as a probabilistic unique decoder. We derive upper bounds on the decoding failure probability of the probabilistic-unique decoders which show that the decoding failure probability is very small for most channel realizations up to the maximal decoding radius. The tightness of the bounds is verified by Monte Carlo simulations.

Original languageEnglish
JournalDesigns, Codes, and Cryptography
StateAccepted/In press - 2024
Externally publishedYes


  • 94B05
  • 94B35
  • Interleaving
  • Multishot network coding
  • Multishot operator channel
  • Subspace codes
  • Sum-subspace metric


Dive into the research topics of 'Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding'. Together they form a unique fingerprint.

Cite this