Generalized Expanded-Blaum-Roth Codes and Their Efficient Encoding/Decoding

Expanded-Blaum-Roth (EBR) code encodes a (p-1)\times k information array into a p\times p array such that any bit in a column can be recovered within the column and any k out of p columns can retrieve all (p-1)\times k information bits, where p is a prime number. In this paper, we generalize the con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Global Communications Conference (Online) s. 1 - 6
Hlavní autoři: Wu, You, Hou, Hanxu, Han, Yunghsiang S., Lee, Patrick P. C., Han, Guojun
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2020
Témata:
Array codes
Arrays
Computational complexity
Decoding
Education
efficient decoding
Encoding
Expanded-Blaum-Roth codes
Redundancy
Reliability
ISSN:2576-6813
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Expanded-Blaum-Roth (EBR) code encodes a (p-1)\times k information array into a p\times p array such that any bit in a column can be recovered within the column and any k out of p columns can retrieve all (p-1)\times k information bits, where p is a prime number. In this paper, we generalize the construction of EBR code with a more flexible parameter, i.e., the number of bits stored in a column in the proposed construction can be not only a prime number but also an even number. In addition, we present an efficient encoding/decoding method for the proposed generalized EBR codes based on the LU factorization of Vandermonde matrix. We show that the proposed encoding/decoding method has less computational complexity than the existing method. Moreover, we show that the minimum symbol distance of generalized EBR codes is the same as that of EBR code for some parameters.
ISSN:2576-6813
DOI:10.1109/GLOBECOM42002.2020.9322165