Self-orthogonal greedy codes (Q1924174): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-orthogonal greedy codes |
scientific article |
Statements
Self-orthogonal greedy codes (English)
0 references
7 September 1997
0 references
Greedy codes are obtained by arranging the binary vectors of length \(n\) in some ordering, selecting the first vector for the code and then, preceeding once through the ordering, selecting a vector if it differs in at least \(d\) positions from all previously selected vectors. It is well-known that greedy codes are linear if the ordering satisfies some properties. The author shows that the linearity remains valid if we stipulate that all code vectores are orthogonal to themselves and the other code vectors. Examples include self-orthogonal \([8,4, 4]\), [22,11,6] and [24,12,8] codes. It is shown that under certain conditions, the greedy self-orthogonal code is not a subcode of the greedy code of equal length and minimum distance.
0 references
linearity
0 references
greedy codes
0 references
self-orthogonal code
0 references