No article text was recorded for this version.
practical implementation gap
Version 1 of 1352 papers367 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Non-Asymptotic Output Statistics of Random Binning and Its Applications
- Blog: Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
- Blog: Improved efficiency for explicit covering codes matching the sphere-covering bound
- Blog: Coding schemes for locally balanced constraints
- Blog: The MIMO Wiretap Channel Decomposed
- Blog: Deterministic Identification Over Fading Channels
- Blog: Codeword or noise? Exact random coding exponents for slotted asynchronism
- Blog: Capacity Region of a New Bus Communication Model
- Blog: Approximate generalized Steiner systems and near-optimal constant weight codes
- Blog: Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
- Blog: Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
- Blog: Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
- Blog: List Decoding Random Euclidean Codes and Infinite Constellations
- Blog: Bounds on Mixed Codes with Finite Alphabets
- Blog: Supporting Information for the Paper: Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five, IEEE Trans. Inform. Theory, To Appear
- Blog: Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel
- Blog: On the Transfer of Information and Energy in Multi-User Systems
- Blog: The Necessity of Relay Selection
- Blog: An Upper Bound on the Sizes of Multiset-Union-Free Families
- Blog: Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections
- Blog: New Bounds for Binary and Ternary Overloaded CDMA
- Blog: Fundamental limits of many-user MAC with finite payloads and fading
- Blog: Seven new champion linear codes
- Blog: On Pseudolinear Codes for Correcting Adversarial Errors
- Blog: A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems
- Blog: Special focus on distributed storage coding
- Blog: Information-Theoretic Caching: The Multi-User Case
- Blog: Gauss-Markov Source Tracking with Side Information: Lower Bounds
- Blog: Message Transmission over Classical Quantum Channels with a Jammer with Side Information: Message Transmission Capacity and Resources
- Blog: Deterministic K-Identification For Binary Symmetric Channel
- Blog: On the Optimality of the ARQ-DDF Protocol.
- Blog: Distributed Function Computation Over a Rooted Directed Tree
- Blog: Output Constrained Lossy Source Coding With Limited Common Randomness
- Blog: Source and Channel Polarization Over Finite Fields and Reed-Solomon Matrices
- Blog: Griesmer and Optimal Linear Codes from the Affine Solomon-Stiffler Construction
- Blog: Repair of Multiple Descriptions on Distributed Storage
- Blog: Limits on the Robustness of MIMO Joint Source-Channel Codes
- Blog: Broadcasting a Common Message with Variable-Length Stop-Feedback Codes
- Blog: Achievability Bounds on Unequal Error Protection Codes
- Blog: Balanced Reed-Solomon Codes
- Blog: Performance Bounds on a Wiretap Network With Arbitrary Wiretap Sets
- Blog: Uniformly Bounded State Estimation Over Multiple Access Channels
- Blog: On The Construction of Capacity-Achieving Lattice Gaussian Codes
- Blog: Toward Optimal Secure Distributed Storage Systems With Exact Repair
- Blog: Odor Intensity Shift Keying (OISK) and Channel Capacity of Odor-Based Molecular Communications in Internet of Everything
- Blog: The Generalized Covering Radii of Linear Codes
- Blog: Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
- Blog: Physical-layer network coding: Tutorial, survey, and beyond
- Blog: On Achievable Rates of AWGN Energy-Harvesting Channels with Block Energy Arrival and Non-Vanishing Error Probabilities
- Blog: Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information
- Blog: On Gaussian Half-Duplex Relay Networks
- Blog: Degraded Broadcast Channel With Secrecy Outside a Bounded Range
- Blog: On noisy duplication channels with Markov sources
- Blog: Repair of Multiple Descriptions on Distributed Storage
- Blog: Degraded Broadcast Channel With Secrecy Outside a Bounded Range
- Blog: Secure Source Coding With a Public Helper
- Blog: Some results of linear codes over the ring $\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$
- Blog: On Achievable Rates Over Noisy Nanopore Channels
- Blog: Hybrid Approaches for Distributed Storage Systems
- Blog: Capacity and Security of Heterogeneous Distributed Storage Systems
Showing 60 of 352 papers.
History & citation
Current · Permanent link
- From Existence Proofs to Practical Capacity Achieving Codes merged into this direction (70% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_practical_implementation_gap_2254ef6a,
title = {practical implementation gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/practical-implementation-gap/rdr_2254ef6af81642e4a3a16287821af2d9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_practical_implementation_gap_2254ef6a_v1,
title = {practical implementation gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/practical-implementation-gap/rdr_2254ef6af81642e4a3a16287821af2d9/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}