In telecommunication, a longitudinal redundancy check (LRC) or horizontal redundancy check is a form of redundancy check that is applied independently to each of a parallel group of bit streams. The data must be divided into transmission blocks, to which the additional check data is added.
Contents
The term usually applies to a single parity bit per bit stream, calculated independently of all the other bit streams (BIP-8). although it could also be used to refer to a larger Hamming code.
This "extra" LRC word at the end of a block of data is very similar to checksum and CRC.
Optimal Rectangular Code
While simple longitudinal parity can only detect errors, it can be combined with additional error control coding, such as a transverse redundancy check, to correct errors. The transverse redundancy check is stored on a dedicated "parity track".
Whenever any single bit error occurs in a transmission block of data, such two dimensional parity checking or "two-coordinate parity checking" enables the receiver to use the TRC to detect which byte the error occurred in, and the LRC to detect exactly which track the error occurred in, to discover exactly which bit is in error, and then correct that bit by flipping it.
Pseudocode
International standard ISO 1155 states that a longitudinal redundancy check for a sequence of bytes may be computed in software by the following algorithm:
which can be expressed as "the 8-bit two's-complement value of the sum of all bytes modulo 28" (x AND 0xFF is equivalent to x MOD 28).
Many protocols use an XOR-based longitudinal redundancy check byte, (often called block check character or BCC), including the serial line internet protocol (SLIP), the IEC 62056-21 standard for electrical meter reading, smart cards as defined in ISO/IEC 7816, and the ACCESS.bus protocol. An 8-bit LRC such as this is equivalent to a cyclic redundancy check using the polynomial x8+1, but the independence of the bit streams is less clear when looked at in that way.