Codes and modular curves

01/09/2023
by   Alain Couvreur, et al.
0

These lecture notes have been written for a course at the Algebraic Coding Theory (ACT) summer school 2022 that took place in the university of Zurich. The objective of the course propose an in-depth presentation of the proof of one of the most striking results of coding theory: Tsfasman Vlăduţ Zink Theorem, which asserts that for some prime power q, there exist sequences of codes over 𝔽_q whose asymptotic parameters beat random codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2022

The equivalence of GRS codes and EGRS codes

Generalized Reed-Solomon and extended generalized Reed-Solomon (abbrevia...
research
08/30/2022

A new construction of nonlinear codes via algebraic function fields

In coding theory, constructing codes with good parameters is one of the ...
research
01/16/2018

Generalized Reed-Muller codes over Galois rings

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes ...
research
07/29/2020

Constructing Partial MDS Codes from Reducible Curves

We propose reducible algebraic curves as a mechanism to construct Partia...
research
06/08/2018

On self-dual and LCD double circulant and double negacirculant codes over F_q + uF_q

Double circulant codes of length 2n over the semilocal ring R = F_q + uF...
research
01/02/2018

Complexity Theory, Game Theory, and Economics

This document collects the lecture notes from my mini-course "Complexity...
research
07/26/2021

PAD: a graphical and numerical enhancement of structural coding to facilitate thematic analysis of a literature corpus

We suggest an enhancement to structural coding through the use of (a) ca...

Please sign up or login with your details

Forgot password? Click here to reset