Coding theory | Articles containing proofs | Inequalities

Singleton bound

In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude upper bound on the size of an arbitrary block code with block length , size and minimum distance . It is also known as the Joshibound. proved by and even earlier by . (Wikipedia).

Video thumbnail

Upper Bound

Upper and Lower Bound In this video, I define what it means for a set to be bounded above and bounded below. This will be useful in our definition of inf and sup. Check out my Real Numbers Playlist: https://www.youtube.com/playlist?list=PLJb1qAQIrmmCZggpJZvUXnUzaw7fHCtoh

From playlist Real Numbers

Video thumbnail

Math 101 091517 Introduction to Analysis 07 Consequences of Completeness

Least upper bound axiom implies a "greatest lower bound 'axiom'": that any set bounded below has a greatest lower bound. Archimedean Property of R.

From playlist Course 6: Introduction to Analysis (Fall 2017)

Video thumbnail

Convergent sequences are bounded

Convergent Sequences are Bounded In this video, I show that if a sequence is convergent, then it must be bounded, that is some part of it doesn't go to infinity. This is an important result that is used over and over again in analysis. Enjoy! Other examples of limits can be seen in the

From playlist Sequences

Video thumbnail

What is a closed set ?

I define closed sets, an important notion in topology and analysis. It is defined in terms of limit points, and has a priori nothing to do with open sets. Yet I show the important result that a set is closed if and only if its complement is open. More topology videos can be found on my pla

From playlist Topology

Video thumbnail

Every Closed Subset of a Compact Space is Compact Proof

Every Closed Subset of a Compact Space is Compact Proof If you enjoyed this video please consider liking, sharing, and subscribing. You can also help support my channel by becoming a member https://www.youtube.com/channel/UCr7lmzIk63PZnBw3bezl-Mg/join Thank you:)

From playlist Topology

Video thumbnail

Every Compact Set in n space is Bounded

Every Compact Set in n space is Bounded If you enjoyed this video please consider liking, sharing, and subscribing. You can also help support my channel by becoming a member https://www.youtube.com/channel/UCr7lmzIk63PZnBw3bezl-Mg/join Thank you:)

From playlist Advanced Calculus

Video thumbnail

Topology: Compactness

This video is about compactness and some of its basic properties.

From playlist Basics: Topology

Video thumbnail

Definition of a Topological Space

Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys Definition of a Topological Space

From playlist Topology

Video thumbnail

Locally testable and locally correctable codes approaching the GV bound - Shubhangi Saraf

Computer Science/Discrete Mathematics Seminar I Topic: Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound Speaker: Shubhangi Sara Affiliation: Rutgers University Date: November 27, 2017 For more videos, please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Many Nodal Domains in Random Regular Graphs - Nikhil Srivastava

Computer Science/Discrete Mathematics Seminar I Topic: Many Nodal Domains in Random Regular Graphs Speaker: Nikhil Srivastava Affiliation: University of California, Berkeley Date: April 04, 2022 A nodal domain of a Laplacian eigenvector of a graph is a maximal connected component where i

From playlist Mathematics

Video thumbnail

Example Memorization in Learning: Batch and Streaming

A Google TechTalk, presented by Gavin Brown, 2022/08 /17 Differential Privacy for ML seminar series.

From playlist Differential Privacy for ML

Video thumbnail

Properties of Compactness

Compact sets enjoy some mysterious properties, which I'll discuss in this video. More precisely, compact sets are always bounded and closed. The beauty of this result lies in the proof, which is an elegant application of this subtle concept. Enjoy! Compactness Definition: https://youtu.be

From playlist Topology

Video thumbnail

When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?

A Google TechTalk, presented by Gavin Brown, Boston University, at the 2021 Google Federated Learning and Analytics Workshop, Nov. 8-10, 2021. For more information about the workshop: https://events.withgoogle.com/2021-workshop-on-federated-learning-and-analytics/#content

From playlist 2021 Google Workshop on Federated Learning and Analytics

Video thumbnail

Can You Navigate If You Don't Know Where You Are?

Suppose you are completely lost at night, you do have a map but you can't read the street signs. Can you find your way? The mathematics of synhronization. Links and resources: Penn & Teller's clock trick on Fool Us: https://www.youtube.com/watch?v=t-uXRepVPOg&t=2017s&ab_channel=ikaamowa

From playlist Summer of Math Exposition Youtube Videos

Video thumbnail

Many Nodal Domains in Random Regular Graphs by Nikhil Srivastava

COLLOQUIUM MANY NODAL DOMAINS IN RANDOM REGULAR GRAPHS SPEAKER: Nikhil Srivastava (University of California, Berkeley) DATE: Tue, 21 December 2021, 16:30 to 18:00 VENUE:Online Colloquium ABSTRACT Sparse random regular graphs have been proposed as discrete toy models of physical sys

From playlist ICTS Colloquia

Video thumbnail

Sparse Graph Limits 1: Left and Right convergence - Jennifer Chayes

Conference on Graphs and Analysis Jennifer Chayes June 6, 2012 More videos on http://video.ias.edu

From playlist Mathematics

Video thumbnail

Putnam Exam | 2010: A1

We give a solution to question A1 from the 2010 William Lowell Putnam Mathematics Competition. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/

From playlist Putnam Exam Solutions: A1/B1

Video thumbnail

Locally Repairable Codes, Storage Capacity and Index Coding - Arya Mazumdar

Computer Science/Discrete Mathematics Seminar I Topic: Locally Repairable Codes, Storage Capacity and Index Coding Speaker: Arya Mazumdar Affiliation: University of Massachusetts, Amherst Date: Febuary 5, 2018 For more videos, please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Choiceless Polynomial Time - Ben Rossman

Computer Science/Discrete Mathematics Seminar I Topic: Choiceless Polynomial Time Speaker: Ben Rossman Affiliation: University of Toronto Date: October 14, 2019 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Finite Square Well Bound States Part 1

We impose boundary conditions and set up the transcendental equation that needs to be solved to find the allowed energies for the Finite Square Well.

From playlist Quantum Mechanics Uploads

Related pages

Arc (projective geometry) | Support (mathematics) | Punctured code | Hamming distance | Coding theory | Finite field | Johnson bound | Reed–Solomon error correction | Plotkin bound | Hamming bound | Projective space | Generator matrix | Linear code | Finite geometry | Homogeneous coordinates | Block code | Gilbert–Varshamov bound | Dual code | Projective geometry | Griesmer bound