Scholarlink

This work investigates Maximum Rank Distance (MRD) convolutional codes, which achieve the highest possible rank distance between codewords. Constructions of such codes only exist for rank metric convolutional codes with certain parameters. In particular for \((n\times m,k,\delta )\) rank metric convolutional codes with \(\delta \le 2m-k\) . In this paper, we propose a novel construction of an MRD \((5 \times 5,1,19)\) rank metric convolutional code.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Construction of an MRD \((5 \times 5, 1, 19)\) Rank Metric Convolutional Code

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Diego Napp,
  • Filipa Santana,
  • Raquel Pinto

摘要

This work investigates Maximum Rank Distance (MRD) convolutional codes, which achieve the highest possible rank distance between codewords. Constructions of such codes only exist for rank metric convolutional codes with certain parameters. In particular for \((n\times m,k,\delta )\) rank metric convolutional codes with \(\delta \le 2m-k\) . In this paper, we propose a novel construction of an MRD \((5 \times 5,1,19)\) rank metric convolutional code.