Good short codes admitting efficient iterative decoding
Organization
Coding and Information Transmission Group
Abstract
Error-correcting codes used in modern communication standards belong to the class of low-density parity-check (LDPC) codes. These codes allow fast decoding based on the iterative belief-propagation (BP) algorithm. Unfortunately, known LDPC codes of length below 500 bits have poor minimum distance and are not efficient enough. The goal of this project is to find algebraic constructions of codes admitting BP decoding. Such codes could be used both for data communications and for post-quantum cryptology.
Graduation Theses defence year
2022-2023
Supervisor
Irina Bocharova
Spoken language (s)
English
Requirements for candidates
Level
Bachelor, Masters
Keywords
Application of contact
Name
Irina Bocharova
Phone
E-mail