arXiv (All)
open access
Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation decoding (SCD), and define the polar complexity of a sequence
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
- Lossy Compression via Sparse Regression Codes: Generalized Construction and Finite-length Bounds#609655
- A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs#1118337
- The Case for Synthesized Data Compression#1234280
- The Case for Synthesized Data Compression#1227423
- On the Average List Size of VT Codes under Two Insertions or Two Deletions#1327017
Record · ID 1386280
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