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

20 results for β€œproduct coding, error correction, reliability, bit-level, block-level”

CS papers only

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

Want pure semantic search? Try claim verification β†’

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.CCcs.AIcs.FLTheoreticalRecentJun 23, 2026

Token Complexity of Certifying Stochastic-Oracle Reliability

Jie Wang

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.

View β†’
cs.CCTheoreticalRecentJul 4, 2026

Additional properties of parity based bit-counting complexity classes and hierarchies

Tayfun Pay

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.

View β†’
cs.CRcs.LOcs.SERecentApr 4, 2026

Optimal Circuit Synthesis of Linear Codes for Error Detection and Correction

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-…

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 β†’
cs.ITcs.AImath.CTTheoreticalRecentJul 15, 2026

CAS I: A Geometric Coding Theorem

Romie Banerjee

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.

View β†’
cs.AREmpiricalRecentJul 13, 2026

Reliable Associative Lookup in Content-Addressable Memory

Fan Li, Yanan Guo, Xin Xin

This paper introduces a new protection code design for Content Addressable Memory (CAM) to ensure reliability.

View β†’
cs.ARcs.LGEmpiricalRecentJul 21, 2026

From Bit-Position Sensitivity to Unequal Error Protection for DNN Inference Memory

Muhammad Husnain Mubarik, Karthik Mohan Kumar, Pedro Antonio Pena, Keshavan Varadarajan +1 more

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…

View β†’
cs.ITcs.AREmpiricalRecentJul 17, 2026

Reducing Power Consumption of Embedded Dynamic Memories with ECCs

Wenqing Song, Yifei Shen, Andreas Burg

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.

View β†’
cs.ARRecentMay 27, 2026

FT-Pilot: Automated Fault-Tolerant RTL Rewriting via Vulnerability-Guided LLMs

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.

View β†’
cs.CLcs.AIcs.LGRecentMay 28, 2026

The Architecture of Errors: From Universal Impossibility to Patch-Local LLM Reliability

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…

View β†’
cs.CRRecentMay 19, 2026

High-Rate Public-Key Pseudorandom Codes for Edit Errors

Shengtang Huang, Xin Li, Songtao Mao, Zhaienhe Zhou

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.

View β†’
cs.ARcs.MSRecentJun 3, 2026

GoldenFloat: A Phi-Derived Static-Split Floating-Point Family from GF4 to GF256 with a Lucas-Exact Integer Identity

Dmitrii Vasiliev

This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.

View β†’