MacWilliams' Extension Theorem for rank-metric codes

被引:0
|
作者
Gorla, Elisa
Salizzoni, Flavio
机构
关键词
Rank-metric codes; Isometries; MacWilliams' Extension Theorem; WEIGHTS; PROOF; LEE;
D O I
10.1016/j.jsc.2023.102263
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The MacWilliams' Extension Theorem is a classical result by Florence Jessie MacWilliams. It shows that every linear isometry between linear block-codes endowed with the Hamming distance can be extended to a linear isometry of the ambient space. Such an extension fails to exist in general for rank-metric codes, that is, one can easily find examples of linear isometries between rank-metric codes which cannot be extended to linear isometries of the ambient space. In this paper, we explore to what extent a MacWilliams' Extension Theorem may hold for rank-metric codes. We provide an extensive list of examples of obstructions to the existence of an extension, as well as a positive result. (c) 2023 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http:// creativecommons .org /licenses /by /4 .0/).
引用
收藏
页数:14
相关论文
共 50 条
  • [31] Column cyclic rank metric codes and linear complementary dual rank metric codes
    de la Cruz, Javier
    Ozbudak, Ferruh
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2024, 23 (07)
  • [32] A rank-metric approach to error control in random network coding
    Silva, Danilo
    Kschischang, Frank R.
    Koetter, Ralf
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) : 3951 - 3967
  • [33] LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
    Renner, Julian
    Puchinger, Sven
    Wachter-Zeh, Antonia
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (06) : 1279 - 1319
  • [34] Additive Rank Metric Codes
    Otal, Kamil
    Ozbudak, Ferruh
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (01) : 164 - 168
  • [35] WATERMARKING AND RANK METRIC CODES
    Lefevre, Pascal
    Carre, Philippe
    Gaborit, Philippe
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 2087 - 2091
  • [36] Universal secure rank-metric coding schemes with optimal communication overheads
    Umberto Martínez-Peñas
    Cryptography and Communications, 2019, 11 : 147 - 166
  • [37] LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
    Julian Renner
    Sven Puchinger
    Antonia Wachter-Zeh
    Designs, Codes and Cryptography, 2021, 89 : 1279 - 1319
  • [38] Universal secure rank-metric coding schemes with optimal communication overheads
    Martinez-Penas, Umberto
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (02): : 147 - 166
  • [39] Extending Coggia–Couvreur attack on Loidreau’s rank-metric cryptosystem
    Anirban Ghatak
    Designs, Codes and Cryptography, 2022, 90 : 215 - 238
  • [40] Rank Metric Codes and Their Galois Duality
    Gao, Qing
    Ding, Yang
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (08) : 1067 - 1071