Multivariate Goppa Codes - Applications in Cryptography and Error Correction
Explore multivariate Goppa codes, their properties, and applications in cryptography and quantum error correction. Gain insights into advanced coding theory and its practical implications.
Lattices and Codes in Cryptography - TCC 2023 Session
Explore cutting-edge research on lattices and codes in cryptography, featuring presentations from leading experts at the Theory of Cryptography Conference 2023.
Algebraic Codes and Algorithms - Part II
Explore advanced concepts in algebraic coding theory and algorithms, focusing on error-correcting codes and their practical applications in data transmission and storage.
Locality in Codes and Computation
Exploring local algorithms in error-correcting codes and their impact on computational theory, from error detection to cryptocurrency applications. Challenges and future directions discussed.
Sparsity and Privacy in Distributed Matrix Multiplication
Explore advanced techniques for distributed matrix multiplication, focusing on sparsity and privacy considerations in large-scale computations.
Service Rates of MDS Codes and Fractional Matchings in Quasi-Uniform Hypergraphs
Explore distributed system performance metrics through service rate regions of MDS codes, connecting them to fractional matching polytopes in quasi-uniform hypergraphs for improved data storage and retrieval.
Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing
Explore advanced techniques in 1-bit compressed sensing, focusing on combinatorial approaches to support recovery and their applications in coding theory.
Coded Matrix Computation: Numerical Stability, Partial Stragglers, and Sparse Input Matrices
Explore advanced techniques for high-dimensional matrix computations in distributed systems, addressing numerical stability, partial stragglers, and sparse input matrices.
Polar Codes for IDS Channels
Explore polar codes for IDS channels, addressing numerical instability, partial stragglers, and worker computation time in sparse matrix scenarios. Learn recent contributions to overcome these challenges.
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
Explores novel error-correction framework for constrained systems, introducing Quantized-Constraint Concatenation and analyzing covering radius to improve DNA storage coding techniques.
Generalized Staircase Codes With Arbitrary Bit Degree
Explores advanced error correction coding for high-performance data transmission, focusing on generalized staircase codes with flexible bit protection and reduced decoding complexity.
Coding for DNA Storage with Nanopore Sequencing
Explore theoretical foundations for synthetic DNA data storage using nanopore sequencing, including channel models, noise characteristics, and coding schemes for practical archival applications.
Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group Testing
Explores sparse codes-on-graphs for quantitative group testing, proposing LDPC codes with single parity-check codes and spatial coupling. Analyzes performance improvements and compares schemes through density evolution.
Mackay-Neal Codes for High-Speed Wireless and Free-Space Optical Links
Explores rate-adaptive MacKay-Neal codes using protographs and distribution matchers for flexible, high-performance wireless and optical communication systems, achieving near-Shannon limit performance across various rates.
Non-binary LDPC Codes for Information Reconciliation in QKD Protocols
Explore new channel coding techniques for decentralized storage systems with adversarial nodes, focusing on non-binary LDPC codes in quantum key distribution protocols.
Binary CSS-T Codes: Characterizations and Posets
Explore characterizations and posets of binary CSS-T codes, delving into their mathematical properties and applications in coding theory.
Dynamic Denoising for AMP Applied to Sparse Regression Inner Codes with Outer Codes
Explores dynamic denoising in AMP for sparse regression codes with outer codes, discussing performance improvements, state evolution approximations, and extensions to multi-user scenarios and multiple measurement vectors.
Precoded Polar Codes With High Error-Correction Capability
Explore recent advancements in precoded polar codes, focusing on low-complexity design, high error-correction capability, and efficient decoding for improved communication systems.
Towards Practical Polar Codes with Low Scaling Exponent
Explore advanced techniques for improving polar codes, focusing on reducing scaling exponents and enhancing practical implementations in coding theory.
Construction and Decoding of Short Codes
Explore advanced techniques for constructing and decoding short-length codes, including staircase matrix codes, ordered statistic decoding, and innovative algorithms for polar codes.
Parameterized Inapproximability of the Minimum Distance Problem over All Fields
Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.