This article is cited in 20 papers

Coding Theory

Minimum Block Length of a Linear $q$-ary Code with Specified Dimension and Code Distance

S. M. Dodunekov


Abstract: 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.

UDC: 621.391.15:519.72

Received: 16.05.1983

 English version: Problems of Information Transmission, 1984, 20:4, 239–249

Bibliographic databases:

• 
•