arXiv (All)
open access
A New Approach to Code Smoothing Bounds
Code smoothing is a phenomenon in which an error distribution makes a code statistically close to the uniform distribution over the ambient space. This closeness is measured by the total variation distance. Recently, Debris-Alazard et al.\ introduced a smoothing bound, which is an upper bound on thi
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
- Bounds for Distributionally Robust Optimization Problems#609778
- On the Generalized Packing and Covering Radii of Codes#1083909
- An Improved Upper Bound for Finite Sidon Sets via Vector-Valued Smoothing#927368
- Finding and Understanding Miscompilation Bugs in the Solidity Compiler#349694
- Ribbon: Scalable Approximation and Robust Uncertainty Quantification#310812
Record · ID 927259
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