Minimum possible block length of a linear binary code for some distances
From MaRDI portal
Publication:798611
zbMath0546.94010MaRDI QIDQ798611
Stefan Dodunekov, Nikolai L. Manev
Publication date: 1984
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (6)
An improvement of the Griesmer bound for some small minimum distances ⋮ Structure of functional codes defined on non-degenerate Hermitian varieties ⋮ A note on the covering radius of optimum codes ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ Divisibility of codes meeting the Griesmer bound ⋮ Classification of Griesmer codes and dual transform
This page was built for publication: Minimum possible block length of a linear binary code for some distances
