The following pages link to (Q4242031):
Displaying 14 items.
- Message-passing algorithms for inference and optimization (Q658470) (← links)
- On quintic quasi-cyclic codes (Q1003727) (← links)
- On viewing block codes as finite automata. (Q1401192) (← links)
- On self-dual ternary codes and their coordinate ordering. (Q1582648) (← links)
- Lattices of quasi-cyclic codes (Q1826968) (← links)
- Approximate NFA universality motivated by information theory (Q2112188) (← links)
- State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
- Matrix theory for minimal trellises (Q2329393) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
- Concatenated kernel codes (Q4965910) (← links)
- Codes on graphs: Recent progress (Q5951414) (← links)
- Approximate NFA universality and related problems motivated by information theory (Q6093572) (← links)
- On the number of distinct \(k\)-decks: enumeration and bounds (Q6112289) (← links)
