Discussion Overview
The discussion revolves around the process of performing modulo 2 long division to find CRC (Cyclic Redundancy Check) code words for given information words using specified CRC polynomials. Participants are examining the correctness of calculations and the application of XOR operations in this context.
Discussion Character
- Technical explanation
- Debate/contested
Main Points Raised
- One participant requests confirmation on their modulo 2 division attempts for two CRC calculations using polynomials 1011 and 1101.
- Another participant suggests checking the calculations by converting binary to decimal and provides a specific numerical example to illustrate a potential error in the first calculation.
- A participant expresses confusion about their final operation in the first question, specifically regarding the XOR operation and the resulting remainder.
- Another participant confirms that the use of XOR is correct in modulo 2 division and expresses that the original answers appear acceptable.
Areas of Agreement / Disagreement
There is no consensus on the correctness of the initial calculations, as one participant identifies a potential error while another believes the answers are correct. The discussion remains unresolved regarding the accuracy of the modulo 2 division results.
Contextual Notes
Participants reference specific binary operations and numerical conversions, but there are unresolved aspects regarding the calculations and the interpretation of the XOR operation in this context.
