Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders
arXiv 2608.23833•5d7004cef6b740759e8328527d2b47b568341c82a52a0bae020a915376f15b00
UAVacademic-researcharXivcoding-theorycompressive-sensingdata-storageerror-correcting-codeshypothesis-testinginformation-theorysecure-ISACsignal-processingwireless-communications
Paper metadata
- arXiv ID
- 2608.23833
- 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
- 5d7004cef6b740759e8328527d2b47b568341c82a52a0bae020a915376f15b00
- Enrichment time
- 2026-08-26T08:51:36Z
- 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.