scientific article; zbMATH DE number 4218008
From MaRDI portal
Publication:3364203
Recommendations
- A lower bound for the computational complexity of characteristic functions of BCH-codes by branching programs
- On lower bounds on the spectrum of a binary code
- The linear programming bound for binary linear codes
- Bounds for code length for circuits of functional elements
- On a lower bound on the number of perfect binary codes
- Lower bounds for binary covering codes
- scientific article; zbMATH DE number 919281
- scientific article; zbMATH DE number 4172394
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- scientific article; zbMATH DE number 1498463
Cited in
(16)- Neither reading few bits twice nor reading illegally helps much
- A lower bound on branching programs reading some bits twice
- On uncertainty versus size in branching programs.
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- Linear codes are hard for oblivious read-once parity branching programs
- Expanders and time-restricted branching programs
- A lower bound for the computational complexity of characteristic functions of BCH-codes by branching programs
- scientific article; zbMATH DE number 4078803 (Why is no real title available?)
- A note on read-k times branching programs
- Upper bounds for the complexity of realization of the characteristic functions of group codes by contact circuits without zero chains
- scientific article; zbMATH DE number 919281 (Why is no real title available?)
- On the hierarchy of nondeterministic branching k-programs
- Limitations of incremental dynamic programming
- New lower bounds and hierarchy results for restricted branching programs
- Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes
- A nondeterministic space-time tradeoff for linear codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3364203)
