On viewing block codes as finite automata. (Q1401192)
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 1965233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On viewing block codes as finite automata. |
scientific article; zbMATH DE number 1965233 |
Statements
On viewing block codes as finite automata. (English)
0 references
17 August 2003
0 references
Block codes
0 references
Tail-biting trellis
0 references
Decoder complexity
0 references
Maximum likelihood decoding
0 references
0.7801990509033203
0 references
