A lower bound for the computational complexity of characteristic functions of BCH-codes by branching programs (Q3115197)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6007837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the computational complexity of characteristic functions of BCH-codes by branching programs |
scientific article; zbMATH DE number 6007837 |
Statements
20 February 2012
0 references
complexity
0 references
lower bound
0 references
branching program
0 references
code
0 references
Bose-Chaudhuri-Hoquinghem codes (BCH-codes)
0 references
