Kneser's theorem for codes and -divisible set families

DOI10.1016/J.FFA.2025.102783MaRDI QIDQ6868403zbMATH OpenFDO

Authors Chenying Lin, Gilles Zémor

Publication date 26 January 2026

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2025.102783

zbMATH Keywords

additive combinatoricscode productscoding theoryset systems

Mathematics Subject Classification ID

Extremal set theory (05D05) Inverse problems of additive number theory, including sumsets (11P70) Linear codes (general theory) (94B05)

Cites work

• Abschätzung der asymptotischen Dichte von Summenmengen
• Additive combinatorics methods in associative algebras
• Boolean designs and self-dual matroids
• Critical Pairs for the Product Singleton Bound
• Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
• scientific article; zbMATH DE number 3732068 (Why is no real title available?)
• On products and powers of linear codes under componentwise multiplication
• On subsets with cardinalities of intersections divisible by a fixed integer
• On Subsets with Intersections of Even Cardinality
• Small doubling, atomic structure and -divisible set families
• Two remarks on eventown and oddtown problems

This page was built for publication: Kneser's theorem for codes and \(\ell\)-divisible set families

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