Applications of Finite Fields in Cryptography and Coding Theory
Metrics that agree on the support of vectors and nearest neighbor decoding
Integrated measurements of multiple scattering of electrons with energies up to 1....
| Full text | |
| Author(s): |
Elimelech, Dor
;
Firer, Marcelo
;
Schwartz, Moshe
;
IEEE
Total Authors: 4
|
| Document type: | Journal article |
| Source: | 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT); v. N/A, p. 6-pg., 2021-01-01. |
| Abstract | |
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) | |
| FAPESP's process: | 13/25977-7 - Security and reliability of Information: theory and practice |
| Grantee: | Marcelo Firer |
| Support Opportunities: | Research Projects - Thematic Grants |