To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Longitudinal redundancy check

From Wikipedia, the free encyclopedia

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.

The term usually applies to a single parity bit per bit stream, calculated independently of all the other bit streams (BIP-8).[1][2]

This "extra" LRC word at the end of a block of data is very similar to checksum and cyclic redundancy check (CRC).

YouTube Encyclopedic

  • 1/5
    Views:
    259 444
    282 886
    45 198
    487 069
    140 596
  • Cyclic Redundancy Check (CRC) - Part 1
  • Checksum
  • 16 - CRC (CYCLIC REDUNDANCY CHECK) IN ERROR DETECTION - COMPUTER NETWORKS
  • Lec-29: Cyclic Redundancy Check(CRC) for Error Detection and Correction | Computer Networks
  • Error Detection

Transcription

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 (TRC), 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",[3] 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.[4][5][6]

Pseudocode

International standard ISO 1155[7] states that a longitudinal redundancy check for a sequence of bytes may be computed in software by the following algorithm:

lrc := 0
for each byte b in the buffer do
    lrc := (lrc + b) and 0xFF
lrc := (((lrc XOR 0xFF) + 1) and 0xFF)

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).

Other forms

Many protocols use an XOR-based longitudinal redundancy check byte (often called block check character or BCC), including the serial line interface protocol (SLIP, not to be confused with the later and well-known Serial Line Internet Protocol),[8] 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.

References

  1. ^ RFC 935: "Reliable link layer protocols".
  2. ^ "Errors, Error Detection, and Error Control:  Data Communications and ComputerNetworks: A Business User's Approach".
  3. ^ "Chapter1". Archived from the original on 2013-06-13. Retrieved 2012-08-20.
  4. ^ Gary H. Kemmetmueller. "RAM error correction using two dimensional parity checking".
  5. ^ Oosterbaan. "Longitudinal parity".
  6. ^ "Errors, Error Detection, and Error Control".
  7. ^ ISO 1155:1978 Information processing -- Use of longitudinal parity to detect errors in information messages.
  8. ^ RFC 914. "A Thinwire Protocol for connecting personal computers to the INTERNET". Appendix D: "Serial Line Interface Protocol (SLIP)".
This page was last edited on 7 July 2023, at 15:30
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.