Expanded Blaum-Roth Codes With Efficient Encoding and Decoding Algorithms

An expansion of Blaum-Roth codes by incorporating a vertical parity on <inline-formula> <tex-math notation="LaTeX">p\times p </tex-math></inline-formula> arrays, where <inline-formula> <tex-math notation="LaTeX">p </tex-math></inline-f...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 23; no. 6; pp. 954 - 957
Main Authors: Blaum, Mario, Deenadhayalan, Veera, Hetzler, Steven
Format: Journal Article
Language:English
Published: IEEE 01.06.2019
Subjects:
array codes
Blaum-Roth (BR) codes
Decoding
Encoding
Erasure-correcting codes
Indexes
MDS codes
Reed-Solomon (RS) codes
Reed-Solomon codes
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An expansion of Blaum-Roth codes by incorporating a vertical parity on <inline-formula> <tex-math notation="LaTeX">p\times p </tex-math></inline-formula> arrays, where <inline-formula> <tex-math notation="LaTeX">p </tex-math></inline-formula> is a prime number, is described. The vertical parity allows for the local recovery of a symbol within a column without invoking the remaining columns. Efficient encoding and erasure decoding procedures are presented, in particular, for the case of two column parities.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2019.2911286