Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Install
Faster access than browser!
 

Fletcher's checksum

Index Fletcher's checksum

The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John G. Fletcher (1934–2012) at Lawrence Livermore Labs in the late 1970s. [1]

18 relations: Adler-32, Algorithm, Array data structure, ASCII, Binary data, Byte, C (programming language), Cyclic redundancy check, Endianness, For loop, Integer overflow, Lawrence Livermore National Laboratory, Mark Adler, Modular arithmetic, Modulo operation, Ones' complement, Subroutine, Variable (computer science).

Adler-32

Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995, and is a modification of the Fletcher checksum.

New!!: Fletcher's checksum and Adler-32 · See more »

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: Fletcher's checksum and Algorithm · See more »

Array data structure

In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.

New!!: Fletcher's checksum and Array data structure · See more »

ASCII

ASCII, abbreviated from American Standard Code for Information Interchange, is a character encoding standard for electronic communication.

New!!: Fletcher's checksum and ASCII · See more »

Binary data

Binary data is data whose unit can take on only two possible states, traditionally termed 0 and +1 in accordance with the binary numeral system and Boolean algebra.

New!!: Fletcher's checksum and Binary data · See more »

Byte

The byte is a unit of digital information that most commonly consists of eight bits, representing a binary number.

New!!: Fletcher's checksum and Byte · See more »

C (programming language)

C (as in the letter ''c'') is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.

New!!: Fletcher's checksum and C (programming language) · See more »

Cyclic redundancy check

A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.

New!!: Fletcher's checksum and Cyclic redundancy check · See more »

Endianness

Endianness refers to the sequential order in which bytes are arranged into larger numerical values when stored in memory or when transmitted over digital links.

New!!: Fletcher's checksum and Endianness · See more »

For loop

In computer science, a for-loop (or simply for loop) is a control flow statement for specifying iteration, which allows code to be executed repeatedly.

New!!: Fletcher's checksum and For loop · See more »

Integer overflow

In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of bits – either larger than the maximum or lower than the minimum representable value.

New!!: Fletcher's checksum and Integer overflow · See more »

Lawrence Livermore National Laboratory

Lawrence Livermore National Laboratory (LLNL) is an American federal research facility in Livermore, California, United States, founded by the University of California, Berkeley in 1952.

New!!: Fletcher's checksum and Lawrence Livermore National Laboratory · See more »

Mark Adler

Mark Adler (born April 3, 1959) is an American software engineer, and has been heavily involved in space exploration.

New!!: Fletcher's checksum and Mark Adler · See more »

Modular arithmetic

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value—the modulus (plural moduli).

New!!: Fletcher's checksum and Modular arithmetic · See more »

Modulo operation

In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus).

New!!: Fletcher's checksum and Modulo operation · See more »

Ones' complement

The ones' complement of a binary number is defined as the value obtained by inverting all the bits in the binary representation of the number (swapping 0s for 1s and vice versa).

New!!: Fletcher's checksum and Ones' complement · See more »

Subroutine

In computer programming, a subroutine is a sequence of program instructions that performs a specific task, packaged as a unit.

New!!: Fletcher's checksum and Subroutine · See more »

Variable (computer science)

In computer programming, a variable or scalar is a storage location (identified by a memory address) paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.

New!!: Fletcher's checksum and Variable (computer science) · See more »

Redirects here:

Fletcher checksum, Fletcher-16, Fletcher-32.

References

[1] https://en.wikipedia.org/wiki/Fletcher's_checksum

OutgoingIncoming
Hey! We are on Facebook now! »