arXiv (All)
open access
Error-Rate Reduction in LDPC Decoding via Bit-Aligned Temporal Reinforcement in Parallel Probabilistic-Bit Dynamics
Probabilistic bits (p-bits) provide a physical and algorithmic primitive for stochastic inference, but highly parallel updates can alter their collective dynamics. We study the decoding of random-regular (3, 6) low-density parity-check (LDPC) codes using Jacobi-type p-bit annealing with stochastic p
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Programmable k-local Ising interactions and shallow optical Kolmogorov--Arnold networks through repeated data encounters#665525
- Programmable k-local Ising interactions and shallow optical Kolmogorov--Arnold networks through repeated data encounters#664025
- Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set#441765
- Where Activation Sparsity and KV-Cache Sparsity Cross in LLM Decoding#1118962
- Concentration for random Euclidean combinatorial optimization#987596
Record · ID 1000342
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive