Official websites do not use .rip
We are an unofficial archive, replace .rip by .gov in the URL to access the official website. Access our document index here.

We are building a provable archive!
A lock ( Dot gov ) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)

Presentation

An Introduction to Tamo-Barg Codes

February 22, 2023

Zach Flores - Latinx Mathematicians Research Community

Abstract. We call a code over a finite alphabet locally recoverable (LRC) if every symbol in the encoding is a function of a (small) number of other symbols. In this talk, we will give an introduction to Tamo-Barg codes, which are a family of LRCs that are not only optimal in a very sensible way, but are also generalizations of the Reed-Solomon codes. In this talk, we discuss how to construct Tamo-Barg codes, their optimality, and the role polynomial interpolation plays in recovering other symbols in the encoding. This will be a basic introduction, and anyone who has taken at least one course in linear and abstract algebra should have no trouble understanding the talk.

Crypto Reading Club meeting on 2023-Feb-22

Parent Project

See: Crypto Reading Club

An Introduction to Tamo-Barg Codes

Presenters

Description

Presented at

Parent Project

Related Topics