On the locality of quasi-cyclic codes over finite fields |
| |
Authors: | Rajput Charul Bhaintwal Maheshanand |
| |
Abstract: | Designs, Codes and Cryptography - A code is said to have locality r if any coordinate value in a codeword of that code can be recovered by at most r other coordinates. In this paper, we have... |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|