Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear
  Regenerating Codes for the Case $d = k = n-1$   In this paper, we consider the setting of exact repair linear regenerating
codes. Under this setting, we derive a new outer bound on the
storage-repair-bandwidth trade-off for the case when $d = k = n -1$, where $(n,
k, d)$ are parameters of the regenerating code, with their usual meaning. Taken
together with the achievability result of Tian et. al. [1], we show that the
new outer bound derived here completely characterizes the trade-off for the
case of exact repair linear regenerating codes, when $d = k = n -1$. The new
outer bound is derived by analyzing the dual code of the linear regenerating
code.

21
The categories of this paper are: adap-org
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci