Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
arXiv 2604.13431•248e089c6841c3adae9900750307a5649c6503007422e40054677cf1ac3079aa
ALOHAAoIRIS-CSI-estimation-ML-inference (RISnet)age-of-informationapproximate-message-passingbinary-erasure-channelcompressed-sensingdistributed-sensor-networksentropyfunction-fieldshalf-duplexinformation-velocitylinear-algebraic-pseudorandomnesslog-sum-penaltyphase-retrievalphase-transitionpolynomial-identity-testingrank-extractorsreconfigurable-intelligent-surfaceriemannian-optimizationshannon-mcmillan-breimanstrong-blocking-setssubspace-designsvarepsilon-biased-setsweighted-RGD
Paper metadata
- arXiv ID
- 2604.13431
- Version
- Not specified by this published record
- Category
- Mathematics — Information Theory (math.IT)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 248e089c6841c3adae9900750307a5649c6503007422e40054677cf1ac3079aa
- Enrichment time
- 2026-04-16T08:51:49Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.