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
Fast Linear Codes over Large Fields: Addition-Only and Small-Coefficient Encoders
ePrint Report: Fast Linear Codes over Large Fields: Addition-Only and Small-Coefficient Encoders Stanislav Peceny, Peter Rindal We construct fast linear codes over large fields using addition-only encoders and variants with small integer coefficients. A local precode is followed by rounds of a random permutation and a scan, a linear recurrence with a short feedback window. At dimension $2^{20}$, r
Reference details
- Source category
- Research & news
- Report title
Fast Linear Codes over Large Fields: Addition-Only and Small-Coefficient Encoders- 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
14d1d16ea54c0d3011e181293a9e4ea84d1f03a519d537ba51de2d20914b2760
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.