On the cyclic redundancy-check codes with 8-bit redundancy

Authors:
Tsonka Baicheva;Stefan Dodunekov;Peter Kazakov
Affiliations:
Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, PO Box 323, 5000 Veliko Tarnovo, Bulgaria;Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., block 8, 1113 Sofia, Bulgaria;Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, PO Box 323, 5000 Veliko Tarnovo, Bulgaria
Venue:
Computer Communications
Year:
1998

Citing 2
Cited 4

Parallel realization of the ATM cell header CRC

Computer Communications
Optimum cyclic redundancy codes for noisy channels (Corresp.)

IEEE Transactions on Information Theory

Extended Binomial Moments of a Linear Code and the Undetected Error Probability

Problems of Information Transmission
Soft self-synchronising codes for self-calibrating communication

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
A survey on proper codes

Discrete Applied Mathematics
Binomial and monotonic behavior of the probability of undetected error and the 2-r-bound

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.24

Visualization

Abstract

Polynomials of degree eight over GF(2) which are suitable to be used as generator polynomials for cyclic redundancy-check (CRC) codes are investigated. Their minimum distance, properness and undetected error probability for binary symmetric channels (BSCs) are compared with the existing ATM standard. Covering radii and the weight distributions of the leaders of cosets are given for all examined codes.