cyclic redundancy code
101Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …
102ECC — noun (telecommunication) a coding system that incorporates extra parity bits in order to detect errors • Syn: ↑error correction code • Topics: ↑telecommunication • Hypernyms: ↑code, ↑computer code …
103Muskegon, Michigan —   City   Nickname(s): Lumbertown Port City Lumber Queen of the World Skeetown (informal) …
104Adler-32 — is a checksum algorithm which was invented by Mark Adler. Compared to a cyclic redundancy check of the same length it trades reliability for speed. Compared to its original form (Fletcher 16), Adler 32 is more reliable than Fletcher 16. However,… …
105Digital recording — Audio levels display on a digital audio recorder (Zoom H4n) In digital recording, digital audio and digital video is directly recorded to a storage device as a stream of discrete numbers, representing the changes in air pressure (sound) for audio …
106FICON — (Fiber Connectivity) is the IBM proprietary name for the ANSI FC SB 3 Single Byte Command Code Sets 3 Mapping Protocol for Fibre Channel (FC) protocol. It is a FC layer 4 protocol used to map both IBM’s antecedent (either ESCON or parallel)… …
107Parallel SCSI — Centronics 50 SCSI plug Parallel SCSI (formally, SCSI Parallel Interface, or SPI) is one of the interface implementations in the SCSI family. In addition to being a data bus, SPI is a parallel electrical bus: There is one set of electrical… …
108LPAC — Lossless Predictive Audio Coder Entwickler: Tilman Liebchen Aktuelle Version: 3.08 (7. Februar 2002) Betriebssystem: Linux, Windows, Solaris …
109Lossless Predictive Audio Coder — Entwickler: Tilman Liebchen Aktuelle Version: 3.08 (7. Februar 2002) Betriebssystem: Linux, Windows, Solaris …
110Линейный код — В области математики и теории информации линейный код  это важный тип блокового кода, использующийся в схемах определения и коррекции ошибок. Линейные коды, по сравнению с другими кодами, позволяют реализовывать более эффективные алгоритмы… …