Linear binary codes with intersection properties
type: Item
instance of: scholarly article
title: Linear binary codes with intersection properties
zbMATH Open document ID: 0549.94023
DOI: 10.1016/0166-218X(84)90018-0
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
review text: 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.
reviewed by: Vladimir D. Tonchev
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 3877078
zbMATH Keywords: binary linear code
author: Dezsö Miklós
MaRDI profile type: Publication
cites work: Minimal 2-coverings of a finite affine space based on GF(2)
cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
Wikidata QID: Q127846006
description: scientific article; zbMATH DE number 3877078