Code-based [3,1]-avoiders in finite affine spaces AG(n,2)

DOI10.1016/J.LAA.2026.07.018MaRDI QIDQ7397209zbMATH OpenFDO

Authors B. Kovacs

Publication date 2026

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2026.07.018

Mathematics Subject Classification ID

Linear algebraic groups over arbitrary fields (20G15) Blocking sets, ovals, (k)-arcs (51E21) Linear codes and caps in Galois spaces (51E22)

Cites work

• A note on the edges of the n-cube
• Additive combinatorics
• Avoiding intersections of given size in finite affine spaces \(\operatorname{AG}(n,2)\)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1544074 (Why is no real title available?)
• Induced subgraphs of given sizes
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• Size functions of subgeometry-closed classes of representable combinatorial geometries
• Weight congruence for p-ary cyclic codes
• Weight Distribution and List-Decoding Size of Reed–Muller Codes
• Weight enumerator for second-order Reed-Muller codes

This page was built for publication: Code-based [3,1]-avoiders in finite affine spaces \(\mathrm{AG}(n,2)\)

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