Computation of the weight distribution of CRC codes
From MaRDI portal
Abstract: In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compute the weight distribution of their dual codes starting from just some ``representative words. Thanks to MacWilliams Theorem, the computation of the weight distribution of dual codes can be easily brought back to that of CRC codes. This algorithm is a good alternative to the standard algorithm that involves listing every word of the code.
Recommendations
- scientific article; zbMATH DE number 7332482
- Two recursive algorithms for computing the weight distribution of certain irreducible cyclic codes
- Fast calculation of the number of minimum-weight words of CRC codes
- Characteristic vector and weight distribution of a linear code
- On computing the weight spectrum of cyclic codes
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 804579 (Why is no real title available?)
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
Cited in
(3)
This page was built for publication: Computation of the weight distribution of CRC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q939177)
