Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes (Q4400274)
From MaRDI portal
scientific article; zbMATH DE number 1182049
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes |
scientific article; zbMATH DE number 1182049 |
Statements
Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes (English)
0 references
2 December 1999
0 references
entropy/length profile
0 references
nonlinear codes
0 references
bipartite graph
0 references
bounds
0 references
state complexity
0 references
branch complexity profiles
0 references
block codes
0 references
