Generalized Staircase Codes With Arbitrary Bit Degree
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a lecture on generalized staircase codes with arbitrary bit degree, presented by Mohannad Shehadeh from the University of Toronto. Delve into a novel generalization of staircase codes for high-rate, high-throughput, and high-reliability forward error correction, particularly relevant to fiber-optic communications. Examine how this approach allows each transmitted symbol to be protected by an arbitrary number of component codewords, rather than just two. Discover the key components of this construction, including Golomb rulers, difference-triangle set generalizations, and (k,s)-nets from finite geometry. Learn how this method enables the use of weak algebraic component codes like extended Hamming codes, potentially leading to significant reductions in decoding complexity and power consumption with minimal performance trade-offs compared to traditional staircase codes.
Syllabus
Generalized Staircase Codes With Arbitrary Bit Degree
Taught by
Simons Institute
Related Courses
Code-Based CryptographyInria (French Institute for Research in Computer Science and Automation) via France Université Numerique Современная комбинаторика (Modern combinatorics)
Moscow Institute of Physics and Technology via Coursera An Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam Coding Theory
NPTEL via YouTube