Application-Driven Coding Theory 2024
2024-03-04..2024-03-08
Berkeley, United States
who it's for
coding theorists, storage engineers, wireless communications engineers, information theorists, quantum error-correction researchers, bioinformatics researchers, distributed systems engineers
topics
polar code design and precoding; ldpc for flash and storage; mutual-information read threshold optimization; locally repairable convertible codes; maximally recoverable codes; dna storage coding with nanopore sequencing; erasure coding for low-latency interaction (RaptorQ); coded matrix computation and partial stragglers; staircase matrix codes and low-latency decoding; quantized-constraint concatenation and covering radius; non-binary ldpc for QKD reconciliation; css-t and magic-state distillation algebra
| title | author | length |
|---|---|---|
| Learning To Communicate | Robert Calderbank | 42m |
Claims that a Zak-OTFS waveform (a pulse quasi‑periodic in delay‑Doppler, produced by an inverse Zak transform) yields a predictable I/O relation and… | ||
| Maximizing Mutual Information in Flash Memories | Richard Wesel | 41m |
Argues that placing read thresholds and write levels by maximizing mutual information yields near-optimal LDPC FER for real flash, using a greedy chain-rule… | ||
| Precoded Polar Codes With High Error-Correction Capability | Vera Miloslavskaya | 30m |
Claims low-complexity recipes to design precoded polar codes that hit both high error-correction capability and low SCL decoding complexity, with concrete… | ||
| Construction And Decoding Of Short Codes | Xiao Ma | 43m |
Introduces staircase matrix codes whose generator/parity structure permits parallel Gaussian elimination, enabling an OSD-like decoder with low latency and… | ||
| Massive scaling in 6G designs | Jing Jiang | 55m |
Timeline: 5G launched commercially ~2019 and release 18 = 5.5G features arrive now, with a study item mid-2025 and 6G products expected 2027+. Claim… | ||
| Practical Error Control Coding For Data Storage | Mats Öberg | 59m |
HDD systems claim about 90% of data-center capacity and use turbo equalization with SOVA + LDPC running ~3–4 iterations per codeword, sweet-spot rates near 90%… | ||
| Convertible codes: Adaptive coding for large-scale data storage | Rashmi Vinayak | 51m |
Introduces Locally Repairable Convertible Codes that combine local repairability with on-the-fly parameter changes and claims practical gains: prototype… | ||
| Towards Practical Polar Codes With Low Scaling Exponent | Peter Trifonov | 28m |
Construction uses generalized concatenation: permuted Arıkan inner kernels combined with Reed‑Solomon outer kernels and recursive ML kernel processing based on… | ||
| Toward Efficient Genomic Compression Using Channel Codes For Joint Alignment And Reconstruction | Yuval Cassuto | 34m |
Proposes a low-complexity compression pipeline that keeps the reference only at the cloud (decoder-only reference) and encodes short samples so alignment and… | ||
| Using Erasure Codes to Enable Interactions over Networks | Michael Luby | 38m |
Claim: using erasure coding instead of retransmit cuts interactive latency and removes stalls on wireless links. Implementation uses the standardized RaptorQ… | ||
| Binary CSS-T codes: characterizations and posets | Gretchen Matthews | 28m |
Gives an equivalent, actionable characterization of binary CSS-T pairs: a pair C1 ⊇ C2 is CSS-T exactly when C2 ⊆ C1 ∩ (C2^2)⊥, replacing the original… | ||
| Algebraic Coding Problems From Quantum Fault-Tolerance | Narayanan Rengaswamy | 31m |
Shows that non-Clifford gates are handled by magic-state distillation and gives the algebraic condition (CSS-T) needed for a code to be preserved by… | ||
| Mackay-Neal Codes For High-Speed Wireless And Free-Space Optical Links | Gianluigi Liva | 31m |
Rate-adaptive MacKay‑Neal constructions use an outer distribution matcher plus a single protograph LDPC inner code to get variable rates at fixed blocklength… | ||
| Interleaved Codes For Cryptography | Antonia Wachter-Zeh | 31m |
Interleaving increases decoding radius: vertical interleaving gives guaranteed unique decoding when the interleaving order l ≥ error rank t, turning many… | ||
| Dynamic Denoising For Amp Applied To Sparse Regression Inner Codes With Outer Codes | Jean-Francois Chamberland | 36m |
Concise claim: embedding LDPC structure into the AMP denoiser via belief propagation yields measurable finite-length gains versus separate decoding, with… | ||
| Non-binary LDPC codes for Information Reconciliation in QKD Protocols | Lara Dolecek | 44m |
Presents optimized nonbinary LDPC designs that use an NB-MLCa split of Q-bit symbols and interleaved decoding to trade complexity for performance, evaluated on… | ||
| Low-Density Parity-Check Codes And Spatial Coupling For Quantitative Group Testing | Michael Lentmaier | 35m |
Replaces BCH constraint nodes with single parity-check codes inside a sparse graph GT scheme, adds spatial coupling, and runs density evolution plus… | ||
| Cover Your Bases: How To Minimize The Sequencing Coverage In Dna Storage Systems | Eitan Yaakobi | 50m |
Storage reading currently costs about $120/GB, so the work targets lowering sequencing reads (coverage depth) and latency. Main claims: the expected number of… | ||
| Quantized-Constraint Concatenation And The Covering Radius Of Constrained Systems | Moshe Schwartz | 27m |
Quantized-Constraint Concatenation (QCC) treats the constrained-encoder as an irreversible quantizer that embeds ECC codewords into the constraint and counts… | ||
| Polar Codes For Ids Channels | Ido Tal | 39m |
Coding scheme for the deletion channel uses long guard bands of zeros inserted recursively, trellis-based decoding and a bespoke trim deletion channel for… | ||
| Coding For Dna Storage With Nanopore Sequencing | Emanuele Viterbo | 50m |
Uses Oxford Nanopore nanopore reads and the Scrappie emulator to model squiggles as noisy, randomly stretched current traces with pore memory moving from 5 to… | ||
| Coded matrix computation: numerical stability, partial stragglers and sparse input matrices | Aditya Ramamoorthy | 43m |
Introduces a real-valued coding scheme that embeds rotation and circulant permutation matrices so Vandermonde-like decoding matrices have unit-circle… | ||
| Approximate coding computing | Stark Draper | 32m |
Describes concrete schemes that trade fidelity for speed by producing an approximate matrix product in stages then exact recovery later, using MatDot-like… | ||
| Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing | Arya Mazumdar | 28m |
One-bit compressed sensing support recovery needs far more non-adaptive, universal measurements than information theory suggests: prior lower bounds are about… | ||
| Service Rates Of Mds Codes & Fractional Matchings In Quasi-Uniform Hypergraphs | Emina Soljanin | 47m |
Shows that the service-rate region of an [n,k] code equals a linear-image of the fractional-matching polytope of a hypergraph built from the generator matrix… | ||
| Sparsity and Privacy in Distributed Matrix Multiplication | Rawad Bitar | 27m |
Claims that perfect information-theoretic privacy forces dense shares for sparse A,B, and that relaxing privacy lets shares keep zeros while leaking a tunable… | ||
| Graph Neural Networks for Classical and Quantum Channel Coding | Sebastian Cammerer | 34m |
The work introduces a fully differentiable GNN decoder that replaces node and edge updates with shared small MLPs (≈2k params each, ≈9–10k total) trained by… | ||
| High-Rate Fair-Density Parity-Check Codes | Hessam Mahdavifar | 41m |
Introduces a deterministic construction: a base matrix with two-ones columns with about 2√n rows, then stack permuted copies to get high-rate codes whose… | ||
| Data Deduplication For Redundant Graph Structures Files | Olgica Milenkovic | 53m |
Investigates deduplication vs retrieval fragmentation by modeling files as self-avoiding walks on a graph and measuring worst-case chunk-read expansion. Proves… | ||
| Private Information Retrieval: Chasing Capacity with Algebraic Codes | Camilla Hollanti | 34m |
Presents a coding-theory approach that frames queries as codewords and uses a star product of storage and query codes to turn responses into decodable… | ||
| Maximally Recoverable Codes | Lalitha Vadlamani | 37m |
Defines three MRC families—locality, hierarchical locality, and tensor/product topologies—and gives explicit constructions that use k-wise independence and… | ||
| nothing matches | ||