Live briefing
Everything about Serial number arithmetic
Many protocols and algorithms require the serialization or enumeration of related entities. For example, a communication protocol must know whether some packet comes "before" or "after" some other packet. The IETF RFC 1982 attempts to define "serial number arithmetic" for the purposes of manipulating and comparing these sequence numbers. In short, when the absolute serial number value decreases by more than half of the maximum value, it is considered to be "after" the former, whereas other decreases are considered to be "before". Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Serial number arithmeticA 5-minute orientation
- Pick up a classic book: JavaScriptThe most-reprinted book on the subject
- Go sideways: Two's complementA closely related topic
- Go sideways: Bitwise operationA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
JavaScriptDavid Flanagan · 1996
Mathematical structures for computer scienceJudith L. Gersting · 1982
The Computer and the BrainJohn von Neumann · 1958
Starting Out with JavaTony Gaddis · 2004
Microprocessor Architecture, Programming, and Applications with the 8085Ramesh S. Gaonkar · 1996
Computer Architecture and OrganizationJohn P. Hayes · 2002
Practical Electronics for InventorsPaul Scherz · 2000
SystemVerilog for VerificationChris Spear · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Two's complement Two's complement is the most common method of representing signed (positive, negative, and zero) integers on computers, and more generally, fixed point…
- Bitwise operation In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its…
- Signed number representations In computing, signed number representations are required to encode negative numbers in binary number systems. In mathematics, negative numbers in any base…
- Arithmetic shift In computer programming, an arithmetic shift is a shift operator, sometimes termed a signed shift (though it is not restricted to signed operands). The…
- Signedness In computing, signedness is a property of data types representing numbers in computer programs. A numeric variable is signed if it can represent both positive…
- Power of two A power of two is a number of the form 2n where n is an integer, that is, the result of exponentiation with the number 2 as the base and integer n as the…
- Fixed-point arithmetic In computing, fixed-point is a method of representing fractional (non-integer) numbers by storing a fixed number of digits of their fractional part. Dollar…
- Logical shift In computer science, a logical shift is a bitwise operation that shifts all the bits of its operand. The two base variants are the logical left shift and…