No label defined (Q4500973)
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 1498783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1498783 |
Statements
3 September 2000
0 references
cyclic redundancy-check codes
0 references
generator polynomials
0 references
proper codes
0 references
good codes
0 references
CRC codes
0 references
0.7949440479278564
0 references
0.7663840055465698
0 references
0.7626252174377441
0 references
0.7426332235336304
0 references
0.7356222867965698
0 references
Binary cyclic redundancy-check (CRC) codes are considered. They are shortened cyclic codes. CRC codes admit quite simple error detection. All the polynomials presented as irreducible polynomials of degree 15 multiplied by \(x+1\) are studied. The polynomials are suitable for generator polynomials for CRC codes. Such characteristics as undetected errors probability, goodness, properness, and minimum distance are computed for the codes. A comparison with known standards is presented. For the entire collection see [Zbl 0918.00043].
0 references
