Projective codes which satisfy the chain condition (Q1588763): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Projective codes which satisfy the chain condition |
scientific article |
Statements
Projective codes which satisfy the chain condition (English)
0 references
4 December 2000
0 references
Binary linear codes with length at most one above the Griesmer bound were shown to satisfy the chain condition by \textit{T. Helleseth}, \textit{T. Kløve} and \textit{Ø. Utrehus} [IEEE Trans. Inf. Theory 38, 1133-1140 (1992; Zbl 0749.94012)]. Some conditions are studied under which codes with length two above the Griesmer bound satisfy the chain condition. Necessary and sufficient conditions for a binary linear code to satisfy the two-way chain condition are given. These results are applied in the study of some two-weight codes and some codes derived from the extended Golay code.
0 references
binary linear codes
0 references
two-way chain condition
0 references
two-weight codes
0 references
