On the minimum depth of circuits with linear number of wires encoding good codes
From MaRDI portal
Publication:6591658
DOI10.1007/978-3-031-49193-1_30MaRDI QIDQ6591658
Publication date: 22 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The average sensitivity of bounded-depth circuits
- Bounded-depth circuits cannot sample good codes
- Graph-theoretic properties in computational complexity
- Superconcentrators of depths 2 and 3; odd levels help (rarely)
- Communication in bounded depth circuits
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Expander codes
- Linear-time encodable and decodable error-correcting codes
- Endcoding Complexity Versus Minimum Distance
- Efficiency of a Good But Not Linear Set Union Algorithm
- Network information flow
- Linear network coding
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
- Bootstrapping results for threshold circuits “just beyond” known lower bounds
- Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
- Fast matrix rank algorithms and applications
This page was built for publication: On the minimum depth of circuits with linear number of wires encoding good codes
