Results 251 to 260 of about 3,084 (282)
Some of the next articles are maybe not open access.

Interleaved cyclic redundancy check (CRC) code

The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, 2004
In this paper, we investigate interleaved cyclic redundancy check (CRC) code. The interleaved CRC can be obtained by merging independent small message blocks into one large block (merged interleaving) or by dividing the original message block into independent small sub blocks (divided interleaving) and then by alternatively dividing the resulting ...
null Jun Jin Kong, K.K. Parhi
openaire   +1 more source

Cyclic redundancy checking

1997
While parity checks are useful for low data rates and asynchronous messages where large gaps in between successive bytes make compilation of data into block impossible, for more general protection of data a much more robust error detection scheme is necessary.
openaire   +1 more source

Cyclic redundancy checks with factorable generators

IEE Proceedings - Communications, 2003
Applications are proposed for cyclic redundancy checks (CRCs) that have factorable rather than primitive generator polynomials. Suitable encoding and decoding methods are developed. Factored-generator CRCs are then compared with tandem CRCs that have an inner code and outer code. When the factors of the generator are used as the generators of the inner
openaire   +1 more source

A study of adaptable co-processors for Cyclic Redundancy Check on an FPGA

2012 International Conference on Field-Programmable Technology, 2012
Cyclic Redundancy Check (CRC) is a well known error detection scheme used to detect corruption of digital content in digital networks and storage devices. In this paper, we present a study of different approaches of designing highly adaptable co-processors for CRC on an FPGA which are used in many network and server applications.
Amila Akagic, Hideharu Amano
openaire   +1 more source

Analysis of checksums, extended-precision checksums, and cyclic redundancy checks

IEEE Transactions on Computers, 1990
The effectiveness of extended-precision checksums is thoroughly analyzed. It is demonstrated that the extended-precision checksums most effectively exploit natural redundancy occurring in program codes. Honeywell checksums and cyclic redundancy checks are compared to extended-precision checksums.
Nirmal R. Saxena, Edward J. McCluskey
openaire   +1 more source

Sphere decoder for polar codes concatenated with cyclic redundancy check

Science China Information Sciences, 2019
The existing cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoder partitions the decoding process into two steps,where an SCL is followed by a CRC check. An SCL decoder can approach the maximum-likelihood (ML) decoding performance of the inner polar codes using a sufficiently large list; however, in this case, CRC is only ...
Yongrun Yu   +3 more
openaire   +1 more source

Computation of cyclic redundancy checks via table look-up

Communications of the ACM, 1988
Cyclic Redundancy Check (CRC) codes provide a simple yet powerful method of error detection during digital data transmission. Use of a table look-up in computing the CRC bits will efficiently implement these codes in software.
openaire   +1 more source

Cyclic Redundancy Check Based Data Authentication in Opportunistic Networks

2019
Opportunistic Networks (OppNets) work with dynamic topology, neither having focused management nor any protection system. Security is a challenging and open research issue in OppNets. A source node always has the concerns about its data. The success of any network depends on percentage of guaranteed and authenticated delivery that it can provide from ...
openaire   +1 more source

Quantum cyclic redundancy check codes.

CoRR, 2023
Ricard Vilar, Simeon Ball
openaire   +1 more source

Home - About - Disclaimer - Privacy