Explicit Almost-Optimal \varepsilon-Balanced Codes via Free Expander Walks
From MaRDI portal
Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
This page was built for publication: Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7213408)