Minimum block length of a linear q-ary code with specified dimension and code distance
type: Item
instance of: scholarly article
title: Minimum block length of a linear q-ary code with specified dimension and code distance
zbMATH Open document ID: 0568.94024
published in: Problems of Information Transmission
publication date: 1984-01-01T00:00:00Z
review text: The article considers the determination of the minimum possible length of a linear code with specified dimension and code distance over a field of q elements. Constructions of minimum-length codes are given, and their properties are investigated. Some refinements of the Griesmer bound are given.
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 3908335
zbMATH Keywords: minimum-length codes
zbMATH Keywords: refinements of the Griesmer bound
author: Stefan Dodunekov
MaRDI profile type: Publication
Recommended article: Minimum possible block length of a linear binary code for some distances
Recommended article: Q3609494
Recommended article: On the minimum length of some linear codes
Recommended article: New bounds for the minimum length of binary linear block codes
Recommended article: Q4315798
Recommended article: On the minimum length of \(q\)-ary linear codes of dimension four
Recommended article: The minimum distance of the [137,69] binary quadratic residue code
Recommended article: On the minimum distance of some quadratic residue codes (Corresp.)
Recommended article: Minimum distance of linear codes and the \(\alpha\)-invariant
Recommended article: A new lower bound on the minimal length of a binary linear code
description: scientific article; zbMATH DE number 3908335