4 problems

Let $\mathbf{H}=\mathbf{H}_{\operatorname{PG}(2,q)}$. Consider minimal pseudo-codewords having minimum AWGNC pseudo-weight among all minimal pseudo-codewords that are not multiples…

Let $q$ be an even prime power and let $\mathbf{H}=\mathbf{H}_{\operatorname{PG}(2,q)}$. A component is significant if, for most lines passing through its point, its value is the s…

Consider the construction described in the preceding examples: start with minimal codewords or pseudo-codewords, add them, and modify selected low-valued components to obtain a min…

Let $\mathbf{H}=\mathbf{H}_{\operatorname{PG}(2,q)}$ and let $\boldsymbol{\omega}\in\mathcal{K}(\mathbf{H})$ be a minimal pseudo-codeword of type $\mathbf{t}$, where $t_0$ is non-n…