Euclidean and Hermitian self-dual MDS codes over large finite fields. (Q1427010): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q591114 |
Changed an Item |
||
Property / author | |||
Property / author: Yoon-Jin Lee / rank | |||
Normal rank |
Revision as of 02:58, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Euclidean and Hermitian self-dual MDS codes over large finite fields. |
scientific article |
Statements
Euclidean and Hermitian self-dual MDS codes over large finite fields. (English)
0 references
14 March 2004
0 references
A self-dual code is a code satisfying \(C=C^\perp\). It is called Euclidean or Hermitian based on which inner-product is used. MDS codes satisfy \(d=n-k+1\) where \(d\) is the minimum Hamming weight, \(n\) is the length of the code and \(k\) is the dimension. The authors use a known technique generalized to these cases to produce self-dual MDS codes and self-dual codes which are almost MDS over large finite fields.
0 references
self-dual codes
0 references
MDS codes
0 references