Computing the probability of undetected error for shortened cyclic codes (Q4004658)
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 57685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the probability of undetected error for shortened cyclic codes |
scientific article; zbMATH DE number 57685 |
Statements
Computing the probability of undetected error for shortened cyclic codes (English)
0 references
27 September 1992
0 references
Cyclic codes
0 references
linear block codes
0 references
probability of an undetected error
0 references
generator polynomial
0 references
code block lengths
0 references
time complexity
0 references
error probabilities
0 references
burst errors
0 references
0.8124224543571472
0 references
0.8124224543571472
0 references
0.8070463538169861
0 references
0.8038599491119385
0 references
0.7955403327941895
0 references
