Optimal possibly nonlinear 3-PIR codes of small size

DOI10.1007/978-3-031-22944-2_9arXiv2208.14552MaRDI QIDQ6169008

Urmas Luhaäär, Henk D. L. Hollmann

Publication date: 10 August 2023

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

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

zbMATH Keywords

Hamming codepacking designbatch codesnonlinear codePIR codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Optimal packings of \(K_4\)'s into a \(K_n\)
• PIR codes with short block length
• Linear Batch Codes
• Batch codes and their applications
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Covering Problems Concerning Abelian Groups

This page was built for publication: Optimal possibly nonlinear 3-PIR codes of small size