scientific article; zbMATH DE number 1284205
This is a very readable survey of recent results on optimal linear codes. It explains clearly many of the techniques that are applied in analyzing and constructing optimal linear codes. First, an elementary introduction to optimal linear codes is given. The authors show how linear codes can be viewed as (multi)-sets in a projective geometry and several examples are given showing how to construct optimal linear codes from geometric objects such as conics and elliptic quadrics etc. Many optimal codes of small dimensions achieve the Griesmer bound. Techniques for constructing codes meeting the Griesmer bound with equality are described as well as a survey of some results regarding the classification of such codes. An overview of some known results on optimal linear codes of small dimensions is given. This is illustrated in detail by giving some of the history behind finding all optimal ternary 5-dimensional linear codes. Connections between minihypers and optimal linear codes are also explained. The authors conclude by mentioning known results on optimal codes of a given codimension. For the entire collection see [Zbl 0911.00024].
- A class of optimal linear codes of length one above the Griesmer bound
- Classification of Griesmer codes and dual transform
- Construction of new Griesmer codes of dimension 5
- Nonexistence of some linear codes over the field of order four
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- A construction of maximal linearly independent array
- A new extension theorem for ternary linear codes and its application
- Recent results and problems on constructions of linear codes from cryptographic functions
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- On the construction of Griesmer codes of dimension 5
- A geometric approach to classifying Griesmer codes
- On the minimum length of linear codes over \(\mathbb{F}_5\)
- On optimal non-projective ternary linear codes
- Geometric extending of divisible codes and construction of new linear codes
- scientific article; zbMATH DE number 4014606 (Why is no real title available?)
- The non-existence of (104,22;3,5)-arcs
- On the geometric constructions of optimal linear codes
- On optimal linear codes of dimension 4
- scientific article; zbMATH DE number 3908334 (Why is no real title available?)
- scientific article; zbMATH DE number 67082 (Why is no real title available?)
- Extension theorems for linear codes over finite fields
- scientific article; zbMATH DE number 1795249 (Why is no real title available?)
- scientific article; zbMATH DE number 1420995 (Why is no real title available?)
- On the minimum length of linear codes over the field of 9 elements
- Intersection sets, three-character multisets and associated codes
- scientific article; zbMATH DE number 6472192 (Why is no real title available?)
- On the construction of optimal linear codes of dimension four
- New upper bounds and constructions of multi-erasure locally recoverable codes
- Locally two-weight property for linear codes and its application
- A generalized extension theorem for linear codes
- On the minimum length of linear codes of dimension 5
- A conjecture on the minimum length of linear codes over finite fields
- The non-existence of \([383, 5, 286]\) and \([447, 5, 334]\) quaternary linear codes
- The non-existence of Griesmer codes with parameters close to codes of Belov type
- On the minimum length of binary linear codes
- Nonexistence of a[\(g_q(5,d),5,d]_q\) code for \(3q^4-4q^3-2q+1\leqslant d\leqslant 3q^4-4q^3-q\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240564)