32-Bit Cyclic Redundancy Code Polynomial (Paperback)


A 32-bit cyclic redundancy code is a type of algebraic polynomial in x with coefficients from a set A of binary numbers. It is used to detect accidental alterations of data during coding and decoding. Castagnoli's results on the algorithmic selection of CRC provide codes which can detect up to 5 errors. In this study we use polynomial algebra over the field and the geometry of the code space to model a class of 32-bit CRC polynomials which can detect up to 7 errors.

R1,041

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles10410
Mobicred@R98pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

A 32-bit cyclic redundancy code is a type of algebraic polynomial in x with coefficients from a set A of binary numbers. It is used to detect accidental alterations of data during coding and decoding. Castagnoli's results on the algorithmic selection of CRC provide codes which can detect up to 5 errors. In this study we use polynomial algebra over the field and the geometry of the code space to model a class of 32-bit CRC polynomials which can detect up to 7 errors.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Lap Lambert Academic Publishing

Country of origin

United States

Release date

July 2013

Availability

Expected to ship within 10 - 15 working days

First published

July 2013

Authors

Dimensions

229 x 152 x 5mm (L x W x T)

Format

Paperback - Trade

Pages

88

ISBN-13

978-3-659-42415-1

Barcode

9783659424151

Categories

LSN

3-659-42415-3



Trending On Loot