Coding theory | Error detection and correction | Finite fields

Justesen code

In coding theory, Justesen codes form a class of error-correcting codes that have a constant rate, constant relative distance, and a constant alphabet size. Before the Justesen error correction code was discovered, no error correction code was known that had all of these three parameters as a constant. Subsequently, other ECC codes with this property have been discovered, for example expander codes.These codes have important applications in computer science such as in the construction of small-bias sample spaces. Justesen codes are derived as the code concatenation of a Reed–Solomon code and the Wozencraft ensemble. The Reed–Solomon codes used achieve constant rate and constant relative distance at the expense of an alphabet size that is linear in the message length. The Wozencraft ensemble is a family of codes that achieve constant rate and constant alphabet size, but the relative distance is only constant for most of the codes in the family. The concatenation of the two codes first encodes the message using the Reed–Solomon code, and then encodes each symbol of the codeword further using a code from the Wozencraft ensemble – using a different code of the ensemble at each position of the codeword. This is different from usual code concatenation where the inner codes are the same for each position. The Justesen code can be constructed very efficiently using only logarithmic space. (Wikipedia).

Video thumbnail

C07 Homogeneous linear differential equations with constant coefficients

An explanation of the method that will be used to solve for higher-order, linear, homogeneous ODE's with constant coefficients. Using the auxiliary equation and its roots.

From playlist Differential Equations

Video thumbnail

Ruud Pellikaan: The coset leader weight enumerator of the code of the twisted cubic

In general the computation of the weight enumerator of a code is hard and even harder so for the coset leader weight enumerator. Generalized Reed Solomon codes are MDS, so their weight enumerators are known and its formulas depend only on the length and the dimension of the code. The coset

From playlist Combinatorics

Video thumbnail

C73 Introducing the theorem of Frobenius

The theorem of Frobenius allows us to calculate a solution around a regular singular point.

From playlist Differential Equations

Video thumbnail

Existence & Uniqueness Theorem, Ex1

Existence & Uniqueness Theorem, Ex1 Subscribe for more math for fun videos 👉 https://bit.ly/3o2fMNo For more calculus & differential equation tutorials, check out @justcalculus 👉 https://www.youtube.com/justcalculus To learn how to solve different types of differential equations: Ch

From playlist Differential Equations: Existence & Uniqueness Theorem (Nagle Sect1.2)

Video thumbnail

Abel formula

This is one of my all-time favorite differential equation videos!!! :D Here I'm actually using the Wronskian to actually find a nontrivial solution to a second-order differential equation. This is amazing because it brings the concept of the Wronskian back to life! And as they say, you won

From playlist Differential equations

Video thumbnail

Using the inverse of an exponential equation to find the logarithm

👉 Learn how to convert an exponential equation to a logarithmic equation. This is very important to learn because it not only helps us explain the definition of a logarithm but how it is related to the exponential function. Knowing how to convert between the different forms will help us i

From playlist Logarithmic and Exponential Form | Learn About

Video thumbnail

Video3-4: Existence and Uniqueness Them; Definition of Wronskian. Elementary Differential Equations

Elementary Differential Equations Video3-4: Existence and Uniqueness Theorem; the Definition and applications of Wronskian on linear dependence Course playlist: https://www.youtube.com/playlist?list=PLbxFfU5GKZz0GbSSFMjZQyZtCq-0ol_jD

From playlist Elementary Differential Equations

Video thumbnail

How to multiply a two digit decimal from a three digit decimal

👉 You will learn how to multiply numbers in decimal form. We will work with decimals that are greater and less than one. When multiplying decimals it is important to line up the decimal point so that you keep the place values of the numbers. We will apply multi digit multiplication to f

From playlist How to multiply and divide decimals

Video thumbnail

Existence & Uniqueness Theorem, Ex1.5

Existence & Uniqueness Theorem for differential equations. Subscribe for more math for fun videos 👉 https://bit.ly/3o2fMNo For more calculus & differential equation tutorials, check out @justcalculus 👉 https://www.youtube.com/justcalculus To learn how to solve different types of d

From playlist Differential Equations: Existence & Uniqueness Theorem (Nagle Sect1.2)

Video thumbnail

‎️‍🔥Welcome to CodeQuest By Simplilearn | Learner Coding Contest | Win Amazing Prices! | Simplilearn

‎️‍🔥Participate Now!: https://docs.google.com/forms/d/e/1FAIpQLSeTGN2Ywq8ubu1gxdG7pEsqXdCZqAf5O41DZjm9t9huFvSc1g/viewform Welcome to Code Quest: A warm welcome to the Coding Contest hosted by Simplilearn and SimpliCode. The idea behind this contest is to encourage and recognize the tru

From playlist Simplilearn Live

Video thumbnail

Seminar on Applied Geometry and Algebra (SIAM SAGA): Gretchen Matthews

Title: Multivariate Goppa Codes Speaker: Gretchen Matthews, Virginia Tech Date: Tuesday, May 10, 2022 at 11:00am Eastern Abstract: Goppa codes were introduced in 1971 by V. D. Goppa using a univariate polynomial g(x), called a generator polynomial, over a finite field. Properties of the G

From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)

Video thumbnail

Everything You Need to Know About JPEG - Episode 4 Part 1: Huffman Decoding

In this series you will learn all of the in-depth details of the complex and sophisticated JPEG image compression format In this episode, we learn all about Huffman codes, how to create a Huffman Coding Tree, and how to create Huffman codes based on a JPEG Huffman Table Jump into the pla

From playlist Fourier

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

Coding Decoding Reasoning Tricks | Coding Decoding Reasoning Examples | Simplilearn

This video on Coding, decoding and reasoning tricks will help you make it easy while preparing for all job-related exams. This video also covers some examples related to coding, decoding, and reasoning and provides a clear explanation for every topic. Topics covered in this coding, decodi

From playlist Data Structures & Algorithms [2022 Updated]

Video thumbnail

Welcome to Code Quest By Simplilearn | Learner Coding Contest | Win Amazing Prices! | Simplilearn

Participate Now!: https://docs.google.com/forms/d/e/1FAIpQLSeEtz4sMPU1vBM0MvScU0h1lPtDTvVaKHyXEe1dnh0vf004uQ/viewform?usp=sf_link Welcome to Code Quest: A warm welcome to the Coding Contest hosted by Simplilearn and SimpliCode. The idea behind this contest is to encourage and recognize

From playlist Simplilearn Live

Video thumbnail

Lec 6 | MIT 6.451 Principles of Digital Communication II

Introduction to Binary Block Codes View the complete course: http://ocw.mit.edu/6-451S05 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.451 Principles of Digital Communication II

Video thumbnail

Lifting small locally testable codes (LTCs) to large LTCs via HDXs - Prahladh Harsha

Computer Science/Discrete Mathematics Seminar I Topic: Lifting small locally testable codes (LTCs) to large LTCs via HDXs Speaker: Prahladh Harsha Affiliation: Tata Institute of Fundamental Research Date: November 25, 2019 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

GORUCO 2016 - Keynote: Code Quality Lessons Learned Bryan Helmkamp

Keynote: Code Quality Lessons Learned Bryan Helmkamp We started Code Climate with a simple hypothesis: static analysis can help developers ship better code, faster. Five years later, we analyze over 70,000 repositories each day spanning a wide variety of programming languages, and along t

From playlist GORUCO 2016

Video thumbnail

How to condense a logarithmic expression using a radical

👉 Learn how to condense logarithmic expressions. A logarithmic expression is an expression having logarithms in it. To condense logarithmic expressions means to use the logarithm laws to reduce logarithm expressions from the expanded form to a condensed form. Knowledge of the logarithm law

From playlist Condense Logarithms with Brackets

Related pages

Reed–Solomon error correction | Wozencraft ensemble | Small-bias sample space | Dimension (vector space) | Block code | Coding theory | Linear code | Field (mathematics) | Concatenated error correction code | Code rate | Expander code | Primitive element (finite field) | Error detection and correction