Designs and their codes
The dimension of projective geometry codes
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
On Abelian difference set codes
Designs, Codes and Cryptography
On the classification of geometric codes by polynomial functions
Designs, Codes and Cryptography
The Mathematical Theory of Coding
The Mathematical Theory of Coding
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors
Designs, Codes and Cryptography
Partial permutation decoding for codes from finite planes
European Journal of Combinatorics
A Class of Three-Weight and Four-Weight Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Small weight codewords in the dual code of points and hyperplanes in PG(n, q), q even
Designs, Codes and Cryptography
| Hi-index | 0.00 |
The geometric codesare the duals of the codes defined by the designs associatedwith finite geometries. The latter are generalized Reed–Mullercodes, but the geometric codes are, in general, not. We obtainvalues for the minimum weight of these codes in the binary case,using geometric constructions in the associated geometries, andthe BCH bound from coding theory. Using Hamada‘sformula, we also show that the dimension of the dual of the codeof a projective geometry design is a polynomial function in thedimension of the geometry.