On Extremal Rates of Secure Storage over Graphs

04/13/2022
by   Zhou Li, et al.
0

A secure storage code maps K source symbols, each of L_w bits, to N coded symbols, each of L_v bits, such that each coded symbol is stored in a node of a graph. Each edge of the graph is either associated with D of the K source symbols such that from the pair of nodes connected by the edge, we can decode the D source symbols and learn no information about the remaining K-D source symbols; or the edge is associated with no source symbols such that from the pair of nodes connected by the edge, nothing about the K source symbols is revealed. The ratio L_w/L_v is called the symbol rate of a secure storage code and the highest possible symbol rate is called the capacity. We characterize all graphs over which the capacity of a secure storage code is equal to 1, when D = 1. This result is generalized to D> 1, i.e., we characterize all graphs over which the capacity of a secure storage code is equal to 1/D under a mild condition that for any node, the source symbols associated with each of its connected edges do not include a common element. Further, we characterize all graphs over which the capacity of a secure storage code is equal to 2/D.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2022

On Extremal Rates of Storage over Graphs

A storage code over a graph maps K independent source symbols, each of L...
research
12/13/2018

On the Capacity of Locally Decodable Codes

A locally decodable code (LDC) maps K source symbols, each of size L_w b...
research
01/13/2021

Distributed storage algorithms with optimal tradeoffs

One of the primary objectives of a distributed storage system is to reli...
research
04/02/2020

Fundamental Limits of Distributed Encoding

In general coding theory, we often assume that error is observed in tran...
research
09/22/2020

Variant-based Equational Unification under Constructor Symbols

Equational unification of two terms consists of finding a substitution t...
research
06/02/2017

Efficient Textual Representation of Structure

This paper attempts a more formal approach to the legibility of text bas...
research
07/15/2021

Compressing Multisets with Large Alphabets

Current methods that optimally compress multisets are not suitable for h...

Please sign up or login with your details

Forgot password? Click here to reset