Binary, shortened projective Reed Muller codes for coded private information retrieval
M Vajha, V Ramkumar… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
The notion of a Private Information Retrieval (PIR) code was recently introduced by Fazeli,
Vardy and Yaakobi [1] who showed that this class of codes permit PIR at reduced levels of
storage overhead in comparison with rephcated-server PIR. In the present paper, the
construction of an (n, k) τ-server binary linear PIR code having parameters n= ℓ Σ i= 0 (mi),
k=(mi) and τ= 2 ℓ for any integer m≥ ℓ≥ 0 is presented. These codes are obtained through
homogeneous-polynomial evaluation and correspond to the binary. Projective Reed Muller …
Vardy and Yaakobi [1] who showed that this class of codes permit PIR at reduced levels of
storage overhead in comparison with rephcated-server PIR. In the present paper, the
construction of an (n, k) τ-server binary linear PIR code having parameters n= ℓ Σ i= 0 (mi),
k=(mi) and τ= 2 ℓ for any integer m≥ ℓ≥ 0 is presented. These codes are obtained through
homogeneous-polynomial evaluation and correspond to the binary. Projective Reed Muller …
以上显示的是最相近的搜索结果。 查看全部搜索结果