Erasures repair for decreasing monomial-Cartesian and augmented Reed-Muller codes of high rate release_xjomhcupqzf3phyrqdgpipjnay

by Hiram H. López, Gretchen L. Matthews, Daniel Valvo

Released as a article .

2021  

Abstract

In this work, we present linear exact repair schemes for one or two erasures in decreasing monomial-Cartesian codes DM-CC, a family of codes which provides a framework for polar codes. In the case of two erasures, the positions of the erasures should satisfy a certain restriction. We present families of augmented Reed-Muller (ARM) and augmented Cartesian codes (ACar) which are families of evaluation codes obtained by strategically adding vectors to Reed-Muller and Cartesian codes, respectively. We develop repair schemes for one or two erasures for these families of augmented codes. Unlike the repair scheme for two erasures of DM-CC, the repair scheme for two erasures for the augmented codes has no restrictions on the positions of the erasures. When the dimension and base field are fixed, we give examples where ARM and ACar codes provide a lower bandwidth (resp., bitwidth) in comparison with Reed-Solomon (resp., Hermitian) codes. When the length and base field are fixed, we give examples where ACar codes provide a lower bandwidth in comparison with ARM. Finally, we analyze the asymptotic behavior when the augmented codes achieve the maximum rate.
In text/plain format

Archived Files and Locations

application/pdf  464.2 kB
file_7dipbqx4vzhhna6rm6rwum4oda
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-07-04
Version   v1
Language   en ?
arXiv  2107.01534v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4a23a41c-33b5-4cb6-ba19-e9677e016581
API URL: JSON