20 results for βerror-correcting codesβ
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.β
Want pure semantic search? Try claim verification β
This paper proposes a Generalized Belief Propagation Network (GBPNet) for error correcting codes that outperforms conventional methods.
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β¦
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.
The authors improve bounds on how well polynomials can approximate the discrete log function.
This paper introduces a new invariant that distinguishes prime alternating knots using the Alexander-Briggs code.
This paper uses large language models to improve the best-known bounds for binary linear codes.
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β¦
This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.
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-β¦
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.
The paper presents three proofs for the generalized Griesmer and antiGriesmer bounds, using different methods and demonstrating their equivalence.
The paper presents a block-based decoder for triangular color-code lattices that achieves strong average-case, smoothed, and sparse-regime guarantees.
This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.
Proposes a semantic successive cancellation list decoder for polar codes that incorporates a fine-tuned language model to improve communication reliability.
This paper introduces skew CRT codes, a decoding algorithm, and the poly-skew metric for error modeling.