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

zbMath0711.94018MaRDI QIDQ923058

L. M. Tombak, Alexander A. Davydov

Publication date: 1989

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

covering radius; projective geometry; linear binary code; quasiperfect code

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

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

Related Items

The Structure of $I_4$-Free and Triangle-Free Binary Matroids, New codes from old; a new geometric construction, A theory on constructing blocked two-level designs with general minimum lower order confounding, 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\), On the size of complete caps in PG\((3,2^{h}\)), Remarks on a generalization of the Davenport constant, 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\), On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\), The packing problem in statistics, coding theory and finite projective spaces, On the structure of large sum-free sets of integers, A note on extending the alias length pattern, On \(k\)-caps in \(\mathrm{PG}(n, q)\), with \(q\) even and \(n \geq 4\), On \(k\)-caps in \(\mathrm{PG}(n, q)\), with \(q\) even and \(n \geq 3\), Stability result for sets with \(3A \neq \mathbb{Z}_5^n\), Three-fold restricted set addition in groups., How long does it take to generate a group?, Generating binary spaces., Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\), On maximal sum-free sets in abelian groups, Results for two-level fractional factorial designs of resolution IV or more, Large sum-free sets in \(\mathbb Z/p\mathbb Z\), Grid representations for \(2^{m-(m-k)}_{\text{IV}}\) join designs containing maximum number of clear two-factor interactions, On sum-free subsets of the torus group, Minimal 1-saturating sets and complete caps in binary projective spaces., Doubling and projection: A method of constructing two-level designs of resolution IV, Large sum-free sets in ternary spaces, On the non-trivial minimal blocking sets in binary projective spaces