Two-weight rank-metric codes
Information Theory
2024-05-07 v1 Combinatorics
math.IT
Abstract
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association schemes, strongly regular graphs, and secret sharing schemes. In this paper, we characterize two-weight codes in the rank metric, answering a recent question posed by Pratihar and Randrianarisoa.
Keywords
Cite
@article{arxiv.2405.02841,
title = {Two-weight rank-metric codes},
author = {Ferdinando Zullo and Olga Polverino and Paolo Santonastaso and John Sheekey},
journal= {arXiv preprint arXiv:2405.02841},
year = {2024}
}
Comments
Accepted for publication in ISIT 2024