A new lower bound on the minimal length of a binary linear code
type: Item
instance of: scholarly article
title: A new lower bound on the minimal length of a binary linear code
zbMATH Open document ID: 0851.94028
author: M. C. Bhandari
author: M. S. Garg
published in: European Journal of Combinatorics
publication date: 1996-12-04T00:00:00Z
review text: \textit{S. M. Dodunekov} and \textit{N. L. Manev} have given lower bounds for \(n(k,d)\), the smallest integer for which there exists a binary \([n, k, d]\)-code [see Discrete Appl. Math. 12, 103-114 (1985; Zbl 0603.94011)]. For many values, these bounds are improved. The question of existence of certain codes is examined to prepare a table of bounds on \(n(9, d)\) for \(d\leq 2^8\).
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 895871
zbMATH Keywords: minimal length
zbMATH Keywords: binary linear code
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: eujc.1996.0028
OpenAlex ID: W2050599192
DOI: 10.1006/EUJC.1996.0028
description: scientific article; zbMATH DE number 895871