scientific article; zbMATH DE number 1284205

From MaRDI portal
Publication:4240564





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].




Cited in
(36)








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)