Rate amplification and query-efficient distance amplification for linear LCC and LDC

DOI10.4230/LIPICS.CCC.2021.1MaRDI QIDQ6115352zbMATH OpenOpenAlexFDO

Authors Gil Cohen

Publication date 12 July 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.CCC.2021.1

zbMATH Keywords

locally correctable codeslocally decodable codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
• Linear programming-based optimization of the distance spectrum of linear block codes
• Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes
• Near-Optimal Quantization and Linear Network Coding for Relay Networks
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
• Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
• Performance of low-density parity-check codes with linear minimum distance
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• Distance Bounds for an Ensemble of LDPC Convolutional Codes

This page was built for publication: Rate amplification and query-efficient distance amplification for linear LCC and LDC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115352)