Linear binary codes with intersection properties (Q800294): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimal 2-coverings of a finite affine space based on GF(2) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank | |||
Normal rank | |||
Revision as of 14:57, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear binary codes with intersection properties |
scientific article |
Statements
Linear binary codes with intersection properties (English)
0 references
1984
0 references
Let p(n,d) (resp. q(n,d)) be the maximal dimension of a binary linear code of length n such that any two distinct nonzero codewords agree in at least (resp. at most) d nonzero positions. It is proved that \(q(n,d)=\min\{n,d+1\}.\) Some bounds for p(n,d) are established, and constructions of related codes are given as well.
0 references
binary linear code
0 references
