ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œerror-correcting codes”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

cs.AIEmpiricalRecentNov 4, 2026

Learning to Decode Linear Codes with Generalized Belief Propagation Network

Samira Malek

This paper proposes a Generalized Belief Propagation Network (GBPNet) for error correcting codes that outperforms conventional methods.

View β†’
cs.LGcs.AIcs.ITRecentMay 27, 2026

Score Based Error Correcting Code Decoder

Alon Helvits, Eliya Nachmani

The paper introduces SB-ECC, a novel score-based decoder that models error correction as continuous-time denoising, achieving state-of-the-art performance across various code families and noise levels…

View β†’
cs.ITcs.CCcs.DSTheoreticalRecentJul 28, 2026

The Code Distortion Problem

Huck Bennett, Matthew Fox, Bryant Morrell

This paper studies the minimum distortion of a linear mapping between two linear error-correcting codes and introduces the Code Distortion Problem, which asks to find a minimum distortion mapping.

View β†’
cs.CCcs.CRTheoreticalRecentOct 24, 2026

Bounds on polynomial approximations of the discrete logarithm function

Swastik Kopparty, Rishabh Kothary, Ashutosh Shankar

The authors improve bounds on how well polynomials can approximate the discrete log function.

View β†’
cs.ITmath.GTTheoreticalRecentJun 9, 2026

A New Invariant for Prime Alternating Knots From Error-Correcting Codes

Altan B. Kilic, Ruud Pellikaan, Alberto Ravagnan

This paper introduces a new invariant that distinguishes prime alternating knots using the Alexander-Briggs code.

View β†’
cs.ITcs.AIcs.NEEmpiricalRecentSep 29, 2026

Evolving Towards Better Codes: LLM-Guided Search for High-Distance Binary Linear Codes

Amal Seddas, Vladyslav Shashkov, Maryna Viazovska, Emmanuel Abbe

This paper uses large language models to improve the best-known bounds for binary linear codes.

View β†’
stat.MLcs.CCcs.DSTheoreticalRecentJul 7, 2026

Boosting with List-Decodable Codes

Addison Prairie, Li-Yang Tan

A new boosting algorithm that strong learns concept classes closed under O(log 1/Ξ³)-XOR using O(log 1/Ξ΅) calls to a Ξ³-advantage weak learner and additional samples, by connecting boosting with list-de…

View β†’
cs.ITTheoreticalRecentJul 7, 2026

From Bit to Block: Capacity Achievement via Product Coding

Bin Zhang

This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.

View β†’
cs.ITcs.NIEmpiricalRecentAug 15, 2026

ICL-SEC: Iterative Cross-Layer Semantic Error Correction

Yirun Wang, Soung Chang Liew, Yuyang Du

This paper proposes iterative cross-layer semantic error correction (ICL-SEC) framework for closing the loop between physical-layer decoder and application-level language model, using a Confirm prior-…

View β†’
cs.ITcs.DMTheoreticalRecentOct 19, 2026

Block basis reduction for linear codes in non-Hamming metrics

N. S. Kolesnikov, S. A. Novoselov

The paper generalizes the code basis reduction to non-Hamming metrics and proposes a block basis reduction algorithm for codes that works for all coordinate-additive metrics.

View β†’
math.COcs.ITTheoreticalRecentAug 5, 2026

The generalized Griesmer and antiGriesmer bounds

Haihua Deng

The paper presents three proofs for the generalized Griesmer and antiGriesmer bounds, using different methods and demonstrating their equivalence.

View β†’
cs.DSTheoreticalRecentJun 9, 2026

Average-Case and Smoothed Near-Optimality for Color-Code Decoding

Daniel Gibney, Jackson Huffstutler

The paper presents a block-based decoder for triangular color-code lattices that achieves strong average-case, smoothed, and sparse-regime guarantees.

View β†’
cs.ITTheoreticalRecentJul 29, 2026

Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse $3$-Uniform Hypergraphs

Xuejiao Han, Yubo Sun, Gennian Ge

This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.

View β†’
cs.ITEmpiricalRecentOct 26, 2026

Semantic SCL Decoding for Polar Codes

Andy Huang, Chentao Yue, Branka Vucetic, Yonghui Li

Proposes a semantic successive cancellation list decoder for polar codes that incorporates a fine-tuned language model to improve communication reliability.

View β†’
cs.ITmath.RATheoreticalRecentJul 20, 2026

Skew CRT codes and their decoding in poly skew metric

Kayode Epiphane Nouetowa, Olivier Ruatta

This paper introduces skew CRT codes, a decoding algorithm, and the poly-skew metric for error modeling.

View β†’