Array Codes With Local Properties

DOI10.1109/TIT.2019.2951693MaRDI QIDQ5124389zbMATH OpenOpenAlexFDO

Authors Mario Blaum, Steven R. Hetzler

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.11731

zbMATH Keywords

Locally Recoverable (LRC) codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: In general, array codes consist of $mimesn$ arrays and in many cases, the arrays satisfy parity constraints along lines of different slopes (generally with a toroidal topology). Such codes are useful for RAID type of architectures, since they allow to replace finite field operations by XORs. We present expansions to traditional array codes of this type, like Blaum-Roth (BR) and extended EVENODD codes, by adding parity on columns. This vertical parity allows for recovery of one or more symbols in a column locally, i.e., by using the remaining symbols in the column without invoking the rest of the array. Properties and applications of the new codes are discussed, in particular to Locally Recoverable (LRC) codes.

Cited in

(2)

• scientific article; zbMATH DE number 1284435 (Why is no real title available?)
• New upper bounds and constructions of multi-erasure locally recoverable codes

This page was built for publication: Array Codes With Local Properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124389)