arXiv (All)
open access
A Note on Sphere Packing Bounds for Tuple Lattice Sieving
A finite set of unit vectors is $k$-irreducible if every signed sum of between two and $k$ distinct elements has norm greater than one. Let $\mathcal{R}_k$ be the maximal asymptotic rate of such sets, and let $κ(α)$ be the maximal asymptotic rate of spherical codes with pairwise inner products at mo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A note on the Kolmogorov-type inequalities for more than three norms#677510
- A note on the Kolmogorov-type inequalities for more than three norms#674312
- Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel#139156
- Binary Deletion Channel Capacity to Within One Hundredth of a Bit#1014006
- SparseStack Is an Optimal Oblivious Subspace Embedding#996948
Record · ID 985566
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive