20 results for βproduct coding, error correction, reliability, bit-level, block-levelβ
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.β
Want pure semantic search? Try claim verification β
This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.
This paper introduces a framework for certifying the reliability of stochastic oracles and derives bounds on the minimum expected token cost for reliable oracle certification.
The paper studies properties of parity based bit-counting complexity classes B|0|βP and B|1|βP, proves inclusions and closures, and shows they contain PH and are contained in CH.
Xi Yang, Taolue Chen, Yuqi Chen, Fu Song +2 more
This paper introduces a novel algorithm, CiSC, to efficiently and optimally synthesize circuit implementations of linear codes for hardware security, significantly outperforming existing state-of-the-β¦
This paper introduces skew CRT codes, a decoding algorithm, and the poly-skew metric for error modeling.
This paper establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.
This paper characterizes per-bit-position fault sensitivity in machine learning inference across various workloads and floating-point formats, identifying a sharp bit-sensitivity transition and deriviβ¦
This paper proposes a method for selecting optimal error-correction codes (ECCs) for gain-cell embedded dynamic random-access memory (GCRAM) to minimize power consumption under a yield constraint.
Weixing Liu, Zizhen Liu, Jing Ye, Naixing Wang +3 more
FT-Pilot is a novel GNN-guided LLM framework that automatically rewrites RTL code to harden digital circuits against soft errors, providing an efficient, automated path for reliability optimization.
Mikhail L. Arbuzov, Lee Mosbacker, Sisong Bei, Ziwei Dong +2 more
The paper reframes LLM reliability from an impossible universal problem to a manageable, local patch-based problem, showing that sufficient interventions can be found by focusing on recurring failureβ¦
The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.
This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.