PIR codes with short block length

DOI10.1007/s10623-020-00828-6zbMath1457.68087arXiv2001.03433OpenAlexW2998864208MaRDI QIDQ2657142

Eitan Yaakobi, Sascha Kurz

Publication date: 17 March 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.03433

zbMATH Keywords

linear codesfinite projective geometryprivate information retrievalPIR codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial structures in finite projective spaces (51E20) Information storage and retrieval of data (68P20) Privacy of data (68P27)

Related Items

Optimal possibly nonlinear 3-PIR codes of small size ⋮ PIR codes from combinatorial structures

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Partial spreads in finite projective spaces and partial designs
• Unrestricted codes with the Golay parameters are unique
• Projective Reed-Muller type codes on higher dimensional scrolls
• Locality and Availability in Distributed Storage
• Private information retrieval
• On a Class of One-Step Majority-Logic Decodable Cyclic Codes
• The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
• Nearly Optimal Constructions of PIR and Batch Codes
• $t$-private information retrieval schemes using transitive codes
• On the uniqueness of the Golay codes
• A Bound for Error-Correcting Codes
• A note on the Griesmer bound (Corresp.)