Characterization of two classes of codes that attain the Griesmer bound (Q2266696): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Q757479 / rank | |||
| Property / author | |||
| Property / author: Nikolai L. Manev / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 06:31, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterization of two classes of codes that attain the Griesmer bound |
scientific article |
Statements
Characterization of two classes of codes that attain the Griesmer bound (English)
0 references
1983
0 references
binary linear codes
0 references
Griesmer bound
0 references
