Metraipolis › archive › dc_9cd398b3f771
A $G$-Invariant Erdős--Hanani Theorem with Applications to Optical Orthogonal and Constant-Weight Codes — arXiv:2610.10973
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10973
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:29:00.068Z
- SHA-256 of the archived text
24248100a3b213296ff009cae65a23e5d604b8a92c0b427afcf28f9a571a9562- Stable URL of this page
https://metraipolis.com/documento/dc_9cd398b3f771
How to cite
A $G$-Invariant Erdős--Hanani Theorem with Applications to Optical Orthogonal and Constant-Weight Codes — arXiv:2610.10973 — arXiv (en), https://arxiv.org/abs/2610.10973 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9cd398b3f771 (Metraipolis archive dc_9cd398b3f771, sha256 24248100a3b213296ff009cae65a23e5d604b8a92c0b427afcf28f9a571a9562)
BibTeX
@misc{dc9cd398b3f771,
title = {A $G$-Invariant Erdős--Hanani Theorem with Applications to Optical Orthogonal and Constant-Weight Codes — arXiv:2610.10973},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10973},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9cd398b3f771; sha256 24248100a3b213296ff009cae65a23e5d604b8a92c0b427afcf28f9a571a9562},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10973. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $k>t\ge 2$ be fixed integers, and let $G$ be a permutation group on a set of $v$ points. A $G$-invariant packing is free if every block has $|G|$ distinct images under $G$. We give two conditions on $G$ under which, as $v\to\infty$, there is a free $G$-invariant $t$-$(v,k,1)$ packing with $(1-o(1))\binom{v}{t}/\binom{k}{t}$ blocks. This is a $G$-invariant form of the Erdős--Hanani theorem on asymptotically optimal packings. For semiregular groups $G$, packings with these properties exist if and only if all but $o(v^t)$ of the $t$-subsets of points have trivial setwise stabiliser. This property is satisfied by every semiregular group for $t\ge 3$, and by every cyclic semiregular group for $t=2$. As a consequence, the Johnson bound is asymptotically attained at all lengths by optical orthogonal codes of constant weight $w$ and constant correlation $\lambda$ with $w\ge\lambda+2$, by their multidimensional and signature pattern versions, and by cyclic and quasi-cyclic constant-weight codes. The same method gives a form of the theorem for group divisible packings that are invariant under a cyclic group. This determines the asymptotic maximum size of two-dimensional optical orthogonal codes with at most one pulse per wavelength.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.10973 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:57.116Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).