Doubly and triply extended MSRD codes (Q6136720)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Doubly and triply extended MSRD codes |
scientific article; zbMATH DE number 7732859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Doubly and triply extended MSRD codes |
scientific article; zbMATH DE number 7732859 |
Statements
Doubly and triply extended MSRD codes (English)
0 references
31 August 2023
0 references
Extended Reed-Solomon codes are formed by extending Vandermonde matrices with additional columns. Doubly and triply extended Reed Solomon codes are Maximum Distance Separable (MDS) codes, that is they meet the Singleton bound \(d \leq n - k + 1\), where \(n\) is the length, \(k\) is the dimension, and \(d\) is the minimum distance. The authors generalize doubly and triply extended Reed Solomon codes and characterize when a multiply extended code attains the Singleton bound for general metrics. He applies this result to produce families of doubly and triply extended Maximum Sum-Rank Distance (MSRD) codes. Necessary and sufficient conditions for the doubly-extended MSRD codes to be one-weight codes are also given.
0 references
doubly extended codes
0 references
linearized Reed-Solomon codes
0 references
maximum sum-rank distance codes
0 references
sum-rank metric
0 references
triply extended
0 references
0 references
0 references
0 references