⚗️ Galois Fields - matmat · Scour

Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard

🔧Reed-Solomon Academic

Less-relevant results

Chopped, Stored, Secured – The Story of the Hash Function

🔐Hash Functions Blog

0xkrt26.github.io··Hacker News

aman179102/distributed-file-storage-service: Distributed File Storage Service — A distributed file storage service (S3-compatible) with erasure coding, replication, chunking/dedup, metadata store (PostgreSQL), REST API, range requests, multipart upload, TTL/expiration, access control (IAM-style policies), Prometheus metrics, and Kubernetes CSI driver.

📚Archive Mathematics Code

github.com··Hacker News

Elements of Cryptanalysis: From Al-Kindi to Post-Quantum Standards — Elements of Cryptanalysis: From Al-Kindi to Post-Quantum Standards

🔐Cryptographic Archaeology

bnaskrecki.faculty.wmi.amu.edu.pl·

Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard

🔢Reed-Solomon Math Academic

Robust Repair of Reed-Solomon Codes

🔧Reed-Solomon Decoders Academic

Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients

💻CS Academic

A New Class of Linear Codes

📚Archive Mathematics Academic

Algebra of Bivariate-Bicycle Surface Codes

🌍Topological Codes Academic

Exact output statistics of Icart's encoding in the exceptional \(j=0\) case

📊Shannon Entropy Academic

Structure and Construction of Two-Dimensional Minimal Linear Codes over the rings $\mathbb{Z}_{p^n}$ with Applications to Secret Sharing

📏Linear Codes Academic

No more posts from matmat's subscribed feeds.

Scour all 25258 feeds Learn more about Feeds

Log in to enable infinite scrolling