New codes from old; a new geometric construction (Q5937137): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1996052195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long binary linear codes and large caps in projective space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 5‐chromatic steiner triple systems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:12, 3 June 2024
scientific article; zbMATH DE number 1618562
Language | Label | Description | Also known as |
---|---|---|---|
English | New codes from old; a new geometric construction |
scientific article; zbMATH DE number 1618562 |
Statements
New codes from old; a new geometric construction (English)
0 references
30 October 2001
0 references
Let \(C\) be a binary linear \((N,k,d)\) code of minimum distance \(d\) at least 4. Let \(n+ 1= N-k\). Then a basis for \(C^\perp\) forms an \((n+1)\times N\) matrix whose columns form a set of \(N\) triply noncollinear points in \(PG(n,2)\) that is called a cap. The authors provide a new construction for codes via this geometric correspondence whereby they increase the dimension \(k\) of the old code by a factor greater than 2 while increasing the length \(N\) by a factor less than 2. Some applications of their technique are also given.
0 references
binary linear code
0 references
cap
0 references