On the computation of the performance probabilities for block codes with a bounded-distance decoding rule (Q3792633)
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: On the computation of the performance probabilities for block codes with a bounded-distance decoding rule |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computation of the performance probabilities for block codes with a bounded-distance decoding rule |
scientific article |
Statements
On the computation of the performance probabilities for block codes with a bounded-distance decoding rule (English)
0 references
1988
0 references
BCH code
0 references
block code
0 references
discrete memoryless channel
0 references
incomplete decoding rule
0 references
generalized distance
0 references
probability of decoding failure
0 references
probability of erroneous decoding
0 references
expected number of symbol decoding errors
0 references
generalized weight enumerator polynomials
0 references
binary codes
0 references
MDS codes
0 references
Reed- Solomon code
0 references
