Longitudinal Redundancy Check (LRC)/2-D Parity Check
Information:
- Compatible with Desktop Operating Systems
- Xojo IDE: 2022 r4.1
- Xojo API: API 2
- Xojo GUI: API 2
- Level: Beginner
Longitudinal Redundancy Check (LRC) is also known as 2-D parity check. In this method, data which the user want to send is organised into tables of rows and columns. A block of bit is divided into table or matrix of rows and columns. In order to detect an error, a redundant bit is added to the whole block and this block is transmitted to receiver. The receiver uses this redundant row to detect error. After checking the data for errors, receiver accepts the data and discards the redundant row of bits.
When a 32-bit block is to be verified, then the following XOR math is performed to determine the LRC bits.
Below is a screen grab of the running Xojo program which contains the LRCcalculation method.
The manual calculation and Xojo method both produce the same result - for verification.
Download the LRC.xojo_binary_project to run the program and download the method within the program.