Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

Quasi-Perfect Linear Codes With Minimum Distance $4$
Long binary linear codes and large caps in projective space
On certain projective geometry codes (Corresp.)
Linear spaces of quadrics and new good codes
A class of quaternary linear codes improving known minimum distances
On the Bounds of Certain Maximal Linear Codes in a Projective Space
A characterization of some odd sets in projective spaces of order 4 and the extendability of quaternary linear codes
Quasi-perfect linear codes from singular plane cubics
Linear codes close to the Griesmer bound and the related geometric structures
Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry

Cited in

(34)

A theory on constructing blocked two-level designs with general minimum lower order confounding
Large sum-free sets in $\mathbb{Z}_5^n$
New codes from old; a new geometric construction
On construction of blocked general minimum lower-order confounding $2^{n - m} : 2^r$ designs with $N / 4 + 1 \leq n \leq 5 N / 16$
Three-fold restricted set addition in groups.
Generating binary spaces.
General minimum lower order confounding designs: an overview and a construction theory
On construction of general minimum lower order confounding $2^{n - m}$ designs with $N/4+1\leq n\leq 9N/32$
Large sum-free sets in ternary spaces
On the structure of large sum-free sets of integers
Quasi-Perfect Linear Codes With Minimum Distance $4$
Stability result for sets with $3A \neq \mathbb{Z}_5^n$
On sizes of complete caps in projective spaces $\mathrm{PG}(n, q)$ and arcs in planes $\mathrm{PG}(2, q)$
On sum-free subsets of the torus group
The packing problem in statistics, coding theory and finite projective spaces
How long does it take to generate a group?
On the size of complete caps in PG$(3,2^{h}$)
A note on extending the alias length pattern
Results for two-level fractional factorial designs of resolution IV or more
On the non-trivial minimal blocking sets in binary projective spaces
The code of the symmetric net with $m$ = 4 and $\mu = 2$
No binary quadratic residue code of length 8m-1 is quasi-perfect
Minimal 1-saturating sets and complete caps in binary projective spaces.
On $k$-caps in $\mathrm{PG}(n, q)$, with $q$ even and $n \geq 4$
The structure of $I_4$-free and triangle-free binary matroids
On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
Grid representations for $2^{m-(m-k)}_{\text{IV}}$ join designs containing maximum number of clear two-factor interactions
Doubling and projection: A method of constructing two-level designs of resolution IV
On maximal sum-free sets in abelian groups
Large sum-free sets in $\mathbb Z/p\mathbb Z$
Remarks on a generalization of the Davenport constant
Dense binary $\mathrm{PG}(t-1,2)$-free matroids have critical number $t-1$ or $t$
On nonlinear 1-quasi-perfect codes and their structural properties
On $k$-caps in $\mathrm{PG}(n, q)$, with $q$ even and $n \geq 3$

This page was built for publication: Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923058)