R.I.P.
π»
Ghosted
On Optimal Locally Repairable Codes with Super-Linear Length
December 31, 2018 Β· Declared Dead Β· π International Symposium on Information Theory
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang
arXiv ID
1812.11942
Category
cs.IT: Information Theory
Citations
56
Venue
International Symposium on Information Theory
Last Checked
5 months ago
Abstract
Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. Optimal codes are constructed, whose length is order-optimal when compared with the new upper bounds. The length of the codes is super-linear in the alphabet size.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Information Theory
R.I.P.
π»
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
π»
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
π
π
The Cartographer
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
π»
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
π
π
The Cartographer
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted