On the minimum depth of circuits with linear number of wires encoding good codes
type: Item
instance of: scholarly article
title: On the minimum depth of circuits with linear number of wires encoding good codes
DOI: 10.1007/978-3-031-49193-1_30
author: Andrew Drucker
author: Yuan Li
publication date: 2024-08-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7900457
zbMATH Keywords: error-correcting codes
zbMATH Keywords: circuit complexity
zbMATH Keywords: superconcentrator
MaRDI profile type: Publication
cites work: Network information flow
cites work: Superconcentrators of depths 2 and 3; odd levels help (rarely)
cites work: Endcoding Complexity Versus Minimum Distance
cites work: The average sensitivity of bounded-depth circuits
cites work: Bootstrapping results for threshold circuits “just beyond” known lower bounds
cites work: Fast matrix rank algorithms and applications
cites work: Q4404124
cites work: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
cites work: Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
cites work: Q3549728
cites work: Linear network coding
cites work: Q3119175
cites work: Bounded-depth circuits cannot sample good codes
cites work: Communication in bounded depth circuits
cites work: Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
cites work: Expander codes
cites work: Linear-time encodable and decodable error-correcting codes
cites work: Efficiency of a Good But Not Linear Set Union Algorithm
cites work: Q4138137
cites work: Graph-theoretic properties in computational complexity
cites work: Q4164821
cites work: Q5215665
description: scientific article; zbMATH DE number 7900457