No article text was recorded for this version.
limitation to linear codes
Version 2 of 2160 papers201 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Lexicographic products and the power of non-linear network coding
- Blog: Characterizing Linear Memory-Rate Tradeoff of Coded Caching: The $(N,K)=(3,3)$ Case
- Blog: Broadcasting with side information
- Blog: The Two-Unicast Problem
- Blog: On optimal policies for control and estimation over a Gaussian relay channel
- Blog: Statistical mechanics of broadcast channels using low-density parity-check codes
- Blog: Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching
- Blog: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Blog: Linear Degrees of Freedom of the $X$ -Channel With Delayed CSIT
- Blog: Testing Equality in Communication Graphs
- Blog: Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- Blog: Bounding multiple unicasts through index coding and Locally Repairable Codes
- Blog: Broadcasting with Side Information
- Blog: On Skew Convolutional and Trellis Codes
- Blog: Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on Dirty Paper and Dirty Tape"
- Blog: Network error correction with unequal link capacities
- Blog: Optimal Index Codes with Near-Extreme Rates
- Blog: Network Coding: An Optimization Approach
- Blog: Linear degrees of freedom of the MIMO X-channel with delayed CSIT
- Blog: Bounding Multiple Unicasts through Index Coding and Locally Repairable Codes
- Blog: A Novel Index Coding Scheme and its Application to Coded Caching
- Blog: Violating the Ingleton Inequality with Finite Groups
- Blog: A Local Perspective on the Edge Removal Problem
- Blog: The Second-Order Football-Pool Problem and the Optimal Rate of Generalized-Covering Codes
- Blog: Ideal-Theoretic Explanation of Capacity-Achieving Decoding
- Blog: Covering Grassmannian Codes: Bounds and Constructions
- Blog: KO codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learning
- Blog: Sum-networks from undirected graphs: Construction and capacity analysis
- Blog: Local Partial Clique Covers for Index Coding
- Blog: Quasi Linear Codes: Application to Point-to-Point and Multi-Terminal Source Coding
- Blog: Secure Index Coding with Side Information
- Blog: On codes with availability for distributed storage.
- Blog: On the number of optimal linear index codes for unicast index coding problems
- Blog: A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems
- Blog: An $O(n^{0.4732})$ upper bound on the complexity of the GKS communication game
- Blog: Index Coding with Coded Side-Information
- Blog: On Maximally Recoverable Local Reconstruction Codes
- Blog: Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
- Blog: Bounds and constructions of codes with all-symbol locality and availability
- Blog: The Serializability of Network Codes
- Blog: Graph-codes
- Blog: Achievability Bounds on Unequal Error Protection Codes
- Blog: MDS Generalized Convertible Code
- Blog: Linear Coding for Gaussian Two-Way Channels
- Blog: Steganographic Codes -- a New Problem of Coding Theory
- Blog: Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- Blog: Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
- Blog: Reciprocity in linear deterministic networks under linear coding
- Blog: Update Efficiency and Local Repairability Limits for Capacity Approaching Codes
- Blog: Robust Non-Linear Feedback Coding via Power-Constrained Deep Learning
- Blog: On the Weight Hierarchy of Locally Repairable Codes
- Blog: On one generalization of LRC codes with availability
- Blog: Diversity Order Analysis for Quantized Constant Envelope Transmission
- Blog: Polar codes for non-identically distributed channels
- Blog: Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Blog: On the Locality of Codeword Symbols in Non-Linear Codes
- Blog: Channel Diversity Needed for Vector Space Interference Alignment
- Blog: Lower bounds for constant query affine-invariant LCCs and LTCs
- Blog: Fundamental limits on communication for oblivious updates in storage networks
- Blog: Coding for Random Projections and Approximate Near Neighbor Search
Showing 60 of 160 papers.
History & citation
Current · Permanent link
- Min-Rank and Efficiency in Index Coding merged into this direction (54% overlap)
- Algebraic Constraints on Network Computation Capacity merged into this direction (56% overlap)
- alphabet size reduction split from this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_limitation_to_linear_codes_c517e51f,
title = {limitation to linear codes},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/limitation-to-linear-codes/rdr_c517e51f72114264890f1e9f7b664609},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_limitation_to_linear_codes_c517e51f_v2,
title = {limitation to linear codes},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/limitation-to-linear-codes/rdr_c517e51f72114264890f1e9f7b664609/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}