An algorithm for computing the distance spectrum of trellis codes (Q3495029)
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 4168378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for computing the distance spectrum of trellis codes |
scientific article; zbMATH DE number 4168378 |
Statements
An algorithm for computing the distance spectrum of trellis codes (English)
0 references
1989
0 references
convolutional encoder
0 references
linear code
0 references
state diagrams
0 references
path
0 references
minimum squared distance
0 references
quasiregular codes
0 references
distance spectrum
0 references
allzero information sequence
0 references
Convolutional codes
0 references
trellis codes
0 references
bidirectional stack algorithm
0 references
Viterbi algorithm
0 references
first-event-error probability
0 references
bit-error probability
0 references
0.839492917060852
0 references
0.8329200744628906
0 references
0.8329200744628906
0 references
