Two classes of minimum generalized distance decoding algorithms (Q1820752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1820752 |
scientific article; zbMATH DE number 3995584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two classes of minimum generalized distance decoding algorithms |
scientific article; zbMATH DE number 3995584 |
Statements
Two classes of minimum generalized distance decoding algorithms (English)
0 references
1986
0 references
We consider two classes of erasure, choosing algorithms for decoding in the generalized distance metric with \(\ell <\lceil (d+1)/2\rceil\) decoding attempts. In each class, we identify and investigate algorithms that minimize the loss of distance compared with the Forney algorithm.
0 references
generalized distance metric
0 references
Forney algorithm
0 references
0.7882328629493713
0 references
0.7861322164535522
0 references
0.7788482308387756
0 references
