Generalized Integrated Interleaved Codes

Wu, Yingquan

doi:10.1109/tit.2016.2633257

Cited by 41 publications

(39 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…✷ The conditions c w ∈ C 0 for 0 w m − 1 and (17) are given as the definition of t-level II-RS codes for s t = 0 in [7], [68], [73], and of t-level EII-RS codes in [8]. As we have seen, t-level EII-RS codes are a special case of the more general class of t-level EII-PC codes.…”

Section: Properties Of Eii-pc Codesmentioning

confidence: 99%

“…As we have seen, t-level EII-RS codes are a special case of the more general class of t-level EII-PC codes. Let us point out that in [32], 2-level II-RS codes are called II codes, while in [68], [73], t-level II-RS codes for t > 2 are called Generalized II (GII) codes. Most papers on II codes follow this convention [36], [76], [77].…”

Section: Properties Of Eii-pc Codesmentioning

confidence: 99%

See 1 more Smart Citation

Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes

Blaum

2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Integrated Interleaved (II) and Extended Integrated Interleaved (EII) codes are a versatile alternative for Locally Recoverable (LRC) codes, since they require fields of relatively small size. II and EII codes are generally defined over Reed-Solomon type of codes. A new comprehensive definition of EII codes is presented, allowing for EII codes over any field, and in particular, over the binary field GF(2). The traditional definition of II and EII codes is shown to be a special case of the new definition. Improvements over previous constructions of LRC codes, in particular, for binary codes, are given, as well as cases meeting an upper bound on the minimum distance. Properties of the codes are presented as well, in particular, an iterative decoding algorithm on rows and columns generalizing the iterative decoding algorithm of product codes. Two applications are also discussed: one is finding a systematic encoding of EII codes such that the parity symbols have a balanced distribution on rows, and the other is the problem of ordering the symbols of an EII code such that the maximum length of a correctable burst is achieved.Constructions of LRC codes involve different issues and tradeoffs, like the size of the field and optimality criteria. The same is true for EPC codes, of which, as we have seen above, LRC codes are a special case. In particular, one goal is to keep the size of the required finite field small, since operations over a small field have less complexity than ones over a larger field due to the smaller look-up tables involved. For example, Integrated Interleaved (II) codes [32], [68] over GF(q), where q > max{m, n}, were proposed in [7] as LRC codes. The construction in [45], [46] (stair codes) reduces field size when failures are correlated. Extended Integrated Interleaved (EII) codes [8] unify product codes and II codes.As is the case with LRC codes, construction of EPC codes involves optimality issues. For example, LRC codes optimizing the minimum distance were presented in [67]. Except for special cases, II codes are not optimal as LRC codes, but the codes in [67] require a field of size at least mn. The same happens with EII codes: except for special cases, they do not optimize the minimum distance [8].There are stronger criteria for optimization than the minimum distance in LRC codes. For example, PMDS codes [5], [9], [19], [23], [33], [35] satisfy the Maximally Recoverable (MR) property [23], [25]. The definition of the MR property is extended for EPC codes in [25], but it turns out that EPC codes with the MR property are difficult to obtain. For example, in [25] it was proven that an EPC code EP(n, 1; n, 1; 1) (i.e., one vertical and one horizontal parity per column and row and one extra parity) with the MR property requires a field whose size is superlinear on n.The EII codes presented in [8], of which II codes [7], [68], [73], [76], [77] are special cases, in general assume a field GF(q) such that q > max{m, n} and the individual codes are RS type of codes. An exception occurs in [73], where b...

show abstract

Section: Properties Of Eii-pc Codesmentioning

confidence: 99%

Section: Properties Of Eii-pc Codesmentioning

confidence: 99%

Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes

Blaum

2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…We start by defining EII codes, which unify product codes and II codes. II codes may be interpreted as m × n arrays such that each row belongs in a code C 0 , and certain linear combinations of the rows belong in nested subcodes of C 0 [2], [40], [42], [44]. In addition, we assume that each column is also in a (vertical) code, making the arrays a subcode of a product code.…”

Section: A Definition Of Extended Integrated Interleaved (Eii) Codesmentioning

confidence: 99%

“…Example 2. Assume that s t = 0 in Definition 1, then, in (4), i 1 and C(n, u) is a t-level II code [2], [40], [42]. So, t-level II codes can be viewed as a special case of t-level EII codes.…”

Section: A Definition Of Extended Integrated Interleaved (Eii) Codesmentioning

confidence: 99%

Extended Product and Integrated Interleaved Codes

Blaum

Hetzler

2018

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is given, as well as constructions meeting the bound for some relevant cases. A special case of EPC codes, Extended Integrated Interleaved (EII) codes, which naturally unify Integrated Interleaved (II) codes and product codes, is defined and studied in detail. It is shown that EII codes often improve the minimum distance of II codes with the same rate, and they enhance the decoding algorithm by allowing decoding on columns as well as on rows. It is also shown that EII codes allow for encoding II codes with an uniform distribution of the parity symbols.

show abstract

“…Matrices A x,x;i,i and A x,y;i,j are substituted in F x,x and F x,y to construct G as specified in (6), (7), and (8). Let C 2 represent the code with generator matrix G. Theorem 1.…”

Section: B Codes With Hierarchical Localitymentioning

confidence: 99%

Hierarchical Coding to Enable Scalability and Flexibility in Heterogeneous Cloud Storage

Yang

Hareedy

Calderbank

et al. 2019

2019 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

In order to accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data storage systems are required to be scalable, flexible, and heterogeneous. Codes with hierarchical locality have been intensively studied due to their effectiveness in reducing the average reading time in cloud storage. In this paper, we present the first codes with hierarchical locality that achieve scalability and flexibility in heterogeneous cloud storage using small field size. We propose a double-level construction utilizing so-called Cauchy Reed-Solomon codes. We then develop a triple-level construction based on this double-level code; this construction can be easily generalized into any hierarchical structure with a greater number of layers since it naturally achieves scalability in the cloud storage systems.

show abstract

Generalized Integrated Interleaved Codes

Cited by 41 publications

References 11 publications

Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes

Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes

Extended Product and Integrated Interleaved Codes

Hierarchical Coding to Enable Scalability and Flexibility in Heterogeneous Cloud Storage

Contact Info

Product

Resources

About