Small weight codewords in the dual code of points and hyperplanes in PG(n, q), q even
Abstract
The main theorem of this article gives a classification of the codewords in Cn-1(n, q), the dual code of points and hyperplanes in PG(n, q), q even, with weight smaller than q + 3√ q2+ 1. In the proof, we rely on the classification of the small blocking sets in PG(2, q), q even. © Springer Science+Business Media, LLC 2011.
Publication Title
Designs, Codes, and Cryptography
Recommended Citation
De Boeck, M. (2012). Small weight codewords in the dual code of points and hyperplanes in PG(n, q), q even. Designs, Codes, and Cryptography, 63 (2), 171-182. https://doi.org/10.1007/s10623-011-9543-8
COinS
