Units of information

Timeline of binary prefixes

This timeline of binary prefixes lists events in the history of the evolution, development, and use of units of measure for information, the bit and the byte, which are germane to the definition of the binary prefixes by the International Electrotechnical Commission (IEC) in 1998. Historically, computers have used many systems of internal data representation, methods of operating on data elements, and data addressing. Early decimal computers included the ENIAC, UNIVAC 1, IBM 702, IBM 705, IBM 650, IBM 1400 series, and IBM 1620. Early binary addressed computers included Zuse Z3, Colossus, Whirlwind, AN/FSQ-7, IBM 701, IBM 704, IBM 709, IBM 7030, IBM 7090, IBM 7040, IBM System/360 and DEC PDP series. Decimal systems typically had memory configured in whole decimal multiples, e.g., blocks of 100 and later 1,000. The unit abbreviation 'K' or 'k' if it was used, represented multiplication by 1,000. Binary memory had sizes of powers of two or small multiples thereof. In this context, 'K' or 'k' was sometimes used to denote multiples of 1,024 units or just the approximate size, e.g., either '64K' or '65K' for 65,536 (216). (Wikipedia).

Video thumbnail

How To Add and Subtract Binary Numbers

This video explains how to add and subtract binary numbers. The full version of this video contains extra examples of subtracting, multiplying, and dividing binary numbers. Full 43 Minute Video: https://www.youtube.com/watch?v=eAdWDu3s8xM

From playlist Number Systems

Video thumbnail

Binary 7 – Floating Point Binary Addition

This is the seventh in a series of videos about the binary number system which is fundamental to the operation of a digital electronic computer. In particular, this video covers adding together floating point binary numbers for a given sized mantissa and exponent, both in two’s complement.

From playlist Binary

Video thumbnail

(New Version Available) Arithmetic Series

New Version: https://youtu.be/GZH68SubgRE This video introduces arithmetic series. http://mathispower4u.yolasite.com/

From playlist Sequences and Series

Video thumbnail

Nexus Trimester - Kasper Green Larsen (Aarhus University) - 2

Data Structure Lower Bounds 2/3 Kasper Green Larsen (Aarhus University) february 22, 2016 Abstract: In this mini-course, we survey the various techniques developed for proving data structure lower bounds. On the dynamic data structures side, we cover the Chronogram Technique of Fredman an

From playlist Nexus Trimester - 2016 - Fundamental Inequalities and Lower Bounds Theme

Video thumbnail

An Introduction to Binary Code Bounds - Fernando Granha Jeronimo

A binary code is simply any subset of 0/1 strings of a fixed length. Given two strings, a standard way of defining their distance is by counting the number of positions in which they disagree. Roughly speaking, if elements of a code are sufficiently far apart, then the code is resilient to

From playlist Mathematics

Video thumbnail

Federated Learning with Formal User-Level Differential Privacy Guarantees

A Google TechTalk, presented by Abhradeep Thakurta, 2022/11/10. Presented at the 2022 Workshop on Federated Learning and Analytics. About the speaker: Bio: Abhradeep Guha Thakurta is a staff research scientist at Google Research on the Brain Team. His research lies in the intersection of

From playlist 2022 Workshop on Federated Learning and Analytics

Video thumbnail

ASCII

From playlist Week 0 2015 Shorts

Video thumbnail

Binary 3 – Fixed Point Binary Fractions

This is the third in a series of videos about the binary number system which is fundamental to the operation of a digital electronic computer. It covers the representation of real numbers in binary using a fixed size, fixed point, register. It explains with examples how to convert both po

From playlist Binary

Video thumbnail

What is the alternate in sign sequence

👉 Learn about sequences. A sequence is a list of numbers/values exhibiting a defined pattern. A number/value in a sequence is called a term of the sequence. There are many types of sequence, among which are: arithmetic and geometric sequence. An arithmetic sequence is a sequence in which

From playlist Sequences

Video thumbnail

Singular Learning Theory - Seminar 18 - The Kraft-McMillan theorem

This seminar series is an introduction to Watanabe's Singular Learning Theory, a theory about algebraic geometry and statistical learning theory. In this seminar Zhongtian Chen proves the Kraft-McMillan theorem, which gives a simple condition under with a uniquely decodable code exists wit

From playlist Singular Learning Theory

Video thumbnail

Binary 8 – Floating Point Binary Subtraction

This is the eighth in a series of videos about the binary number system which is fundamental to the operation of a digital electronic computer. In particular, this video covers subtraction of floating point binary numbers for a given sized mantissa and exponent, both in two’s complement.

From playlist Binary

Video thumbnail

(IC 5.4) Why the interval needs to be completely contained

To ensure unique decodeability, it's necessary that the interval [a,b) contain the whole interval corresponding to the encoded binary sequence, rather than just containing the number corresponding to the binary sequence. A playlist of these videos is available at: http://www.youtube.com/

From playlist Information theory and Coding

Video thumbnail

Binary 1 - Converting to and from Denary

This is the first in a series of computer science videos about the binary number system which is fundamental to the operation of a digital electronic computer. It covers the need for binary and details of how to convert positive whole numbers in base 10 into 8 bit binary, and vice versa.

From playlist GCSE Computer Science

Video thumbnail

Lec 2 | MIT 6.450 Principles of Digital Communications I, Fall 2006

Lecture 2: Discrete source encoding View the complete course at: http://ocw.mit.edu/6-450F06 Instructors: Prof. Lizhong Zheng, Prof. Robert Gallager License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.450 Principles of Digital Communications, I Fall 2006

Video thumbnail

BinDiff and IDA Pro - Reverse Engineering Speed Hacks

Join us for some quick tips on how to use BinDiff and IDA Pro to speed up your malware triage! BinDiff is much more than just a binary diffing tool, expand for more... ----- OALABS DISCORD https://discord.gg/6h5Bh5AMDU OALABS PATREON https://www.patreon.com/oalabs OALABS TIP JAR https:/

From playlist Quick Tips

Video thumbnail

(IC 2.10) Kraft-McMillan - examples for (b)

For a given set of lengths, the Kraft-McMillan inequality is a necessary condition for the existence of a uniquely decodable code, and a sufficient condition for the existence of a prefix code. A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC83

From playlist Information theory and Coding

Video thumbnail

(IC 2.11) Kraft-McMillan - proof sketch for (b)

For a given set of lengths, the Kraft-McMillan inequality is a necessary condition for the existence of a uniquely decodable code, and a sufficient condition for the existence of a prefix code. A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC83

From playlist Information theory and Coding

Video thumbnail

Fenwick Tree range queries

Related Videos: Fenwick tree range queries: https://www.youtube.com/watch?v=RgITNht_f4Q Fenwick tree point updates: https://www.youtube.com/watch?v=B-BkW9ZpKKM Fenwick tree construction: https://www.youtube.com/watch?v=BHPez138yX8 Fenwick tree source code: https://www.youtube.com/watch?v=e

From playlist Data structures playlist

Video thumbnail

Lecture 9c - Decision Trees

Lecture 9b - Decision Trees

From playlist Graph Theory

Video thumbnail

Introduction to Sequences (Discrete Math)

This video introduces sequences for a discrete math class. mathispower4u.com

From playlist Sequences (Discrete Math)

Related pages

Yottabyte | Communications of the ACM | Zettabyte | Baud | Decimal | SI prefix | Petabyte | John Tukey | Claude Shannon | Unit of measurement | Exabyte | Byte | Bit | Binary prefix | One-third octave