parity check


Also found in: Thesaurus, Encyclopedia, Wikipedia.

parity check

n
(Computer Science) a check made of computer data to ensure that the total number of bits of value 1 (or 0) in each unit of information remains odd or even after transfer between a peripheral device and the memory or vice versa
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.parity check - a system of checking for errors in computer functioning
confirmation, substantiation, verification, check - additional proof that something that was believed (some fact or hypothesis or theory) is correct; "fossils provided further confirmation of the evolutionary theory"
References in periodicals archive ?
- Line rates up to 2Gbps with adaptive modulation and state of the art LDPC (low-density parity check) forward error correction ensure error-free operation over any type of wire, including old telephone lines that may be subject to ingress noise.
Built-in LDPC (Low Density Parity Check) ECC engine with RAID and SRAM ECC upgrades increase data write stability and product durability, satisfying the requirements of various industrial and embedded applications.
However, it needs to perform specific column and row permutations to transform the parity check matrix, which changes the structure of CPMs.
Soft decision decoding propagate probabilities through the Tanner graph of parity check matrix, H represented using a bipartite graph.
Engineered with a RAID engine and LDPC (Low-Density Parity Check) coding, a powerful ECC algorithm, and built-in wear-leveling technology.
to Transcend, the drive is loaded with low-density parity check (LDPC)
In 1962, Gallager invented low density parity check (LDPC) [5]codes in his thesis; along with an elegant iterative decoding scheme.
 Empowers the user to compare competitor rates & OTA rank in real-time along with the Parity Check reports.
LDPC ECC (low density parity check error correction) prevents data corruption and promotes integrity, while Data Shaping evenly distributes task loads across NAND Flash cells.
Let C be a non-trivial, reduced linear completely regular code over GF(q) in [GAMMA] = H(n, q) with intersection numbers [[gamma].sub.i], [[alpha].sub.i], [[beta].sub.i] and parity check matrix H.
Section 4 shows the reconstruction algorithm of parity check matrix.