Storage codes and recoverable systems on lines and grids
From MaRDI portal
Publication:6651910
DOI10.1007/s10623-024-01481-zMaRDI QIDQ6651910
Ohad Elishco, Geyang Wang, Ryan Gabrys, Eitan Yaakobi, Alexander Barg
Publication date: 11 December 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gibbs measures and phase transitions.
- Entropy and isomorphism theorems for actions of amenable groups
- Information flows, graphs and their guessing numbers
- On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres
- Storage Capacity of Repairable Networks
- On the Locality of Codeword Symbols
- Multidimensional cellular automata and generalization of Fekete's lemma
- On difference sets of sequences of integers. I
- A maximal extension of the best-known bounds for the Furstenberg–Sárközy theorem
- Fundamentals of Index Coding
- Perfect Codes and Related Structures
- Recoverable Systems
- Fekete's lemma for componentwise subadditive functions of two or more real variables
- Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate
- Product Constructions for Perfect Lee Codes
- Index Coding With Side Information
- Codes for Distributed Storage
- On perfect codes and related concepts
- Construction of storage codes of rate approaching one on triangle-free graphs
- On linear diameter perfect Lee codes with distance 6
- High-Rate Storage Codes on Triangle-Free Graphs
This page was built for publication: Storage codes and recoverable systems on lines and grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651910)
