arXiv (OAI Expanded)
open access
Symmetric Models for Syndrome Decoding
This paper introduces a new polynomial model for the exact variant of the Syndrome Decoding Problem (SDP) in the binary case. The model is based on elementary symmetric polynomials. We estimate the computational complexity of solving the corresponding polynomial system by establishing bounds on the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Practical Linear-Time Computation of Smallest Suffixient Sets#665834
- Practical Linear-Time Computation of Smallest Suffixient Sets#664334
- The Inverse Lyndon Array#1049142
- Upper and lower bounds on the OBDD-width of a special integer multiplication#818720
- Upper and lower bounds on the OBDD-width of a special integer multiplication#808728
Record · ID 1083529
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive