| Texto completo | |
| Autor(es): |
Elimelech, Dor
;
Firer, Marcelo
;
Schwartz, Moshe
;
IEEE
Número total de Autores: 4
|
| Tipo de documento: | Artigo Científico |
| Fonte: | 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT); v. N/A, p. 6-pg., 2021-01-01. |
| Resumo | |
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes - the generalized covering radius. The generalized covering-radius hierarchy of a linear code characterizes the trade-off between storage amount, latency, and access complexity, in such database systems. Several equivalent definitions are provided, showing this as a combinatorial, geometric, and algebraic notion. We derive bounds on the code parameters in relation with the generalized covering radii, study the effect of simple code operations, and describe a connection with generalized Hamming weights. (AU) | |
| Processo FAPESP: | 13/25977-7 - Segurança e confiabilidade da informação: teoria e prática |
| Beneficiário: | Marcelo Firer |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |