arXiv (All)
open access
Certified Adaptive List Decoding for Error-Correcting Codes
Maximum-likelihood (ML) decoding of linear block codes is NP-hard, so neural decoders are evaluated by how closely they approach it. We observe that proving a candidate optimal can be far easier than finding it, and build a decoder that does both. We cast decoding as a search over an absorbing-state
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
- Decoding Error Probability of the Random Code Ensemble over the Erasure Channel#927955
- MacKay-Neal Codes Achieve Capacity under MAP Decoding#1234644
- KKTCode: Asymptotically Optimal Linear Codes for Noisy Feedback AWGN Channels#1116449
- Subspace Based Identification of Errors-in-Variables Linear Descriptor Systems#799475
- Subspace Based Identification of Errors-in-Variables Linear Descriptor Systems#798052
Record · ID 1403600
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