src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 04, 2026 22:00 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
Expander-Based Codes at the Gilbert–Varshamov Bound
ePrint Report: Expander-Based Codes at the Gilbert–Varshamov Bound Peter Rindal We prove that Expand--Accumulate (EA) codes approach the Gilbert--Varshamov (GV) distance as the code length grows. The result holds over the binary field and every fixed finite field. At fixed rate, encoding uses $O(n\log n)$ expected field operations, with a tunable inverse-polynomial probability of sampling a bad co
Reference details
- Source category
- Research & news
- Report title
Expander-Based Codes at the Gilbert–Varshamov Bound- First reported
- Oct 04, 2026 22:00 UTC
- Last reported
- Oct 04, 2026 22:00 UTC
- Catalog updated
- Oct 08, 2026 03:46 UTC
- Record ID
c52acfff0e3bd69468f4aeb5de8f99770c96b2eafafebdcf3d10d54a546da2f3
Published indicators
Network indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
Source observations
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Feed collection status
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 1 unverified.
Review source update dates and status
- src_e53adb99e40ae66258Collection status unverifiedLast successful batch: Unverified
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.