Two-weight rank-metric codes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929335606181888 |
|---|---|
| author | Zullo, Ferdinando Polverino, Olga Santonastaso, Paolo Sheekey, John |
| author_facet | Zullo, Ferdinando Polverino, Olga Santonastaso, Paolo Sheekey, John |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_02841 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Two-weight rank-metric codes Zullo, Ferdinando Polverino, Olga Santonastaso, Paolo Sheekey, John Information Theory Combinatorics 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. |
| title | Two-weight rank-metric codes |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2405.02841 |