Classification of Griesmer codes and dual transform (Q1043574): Difference between revisions

This work is devoted to the classification of infinite families of Griesmer codes, which are linear codes achieving the Griesmer bound. To that end the author uses the fact that all codes from a family can be mapped to projective dual codes with fixed length via the projective dual transform \(D_{\alpha,\beta,m}(C)\). Large families of Griesmer codes over fields with \(2\), \(3\) and \(4\) elements are classified. A list of parameters of all binary projective Griesmer codes of dimension \(2\leq k\leq 6\), where \(\alpha=1,\beta=-d\) and \(m=k\) is included.