PIR codes with short block length
In this work private information retrieval (PIR) codes are studied. In ak-PIR code, s
information bits are encoded in such a way that every information bit has k mutually disjoint …
information bits are encoded in such a way that every information bit has k mutually disjoint …
Generalized Hamming weights and symbolic powers of Stanley-Reisner ideals of matroids
M DiPasquale, L Fouli, A Kumar… - arXiv preprint arXiv …, 2024 - arxiv.org
It is well-known that the first generalized Hamming weight of a code, more commonly
called\textit {the minimum distance} of the code, corresponds to the initial degree of the …
called\textit {the minimum distance} of the code, corresponds to the initial degree of the …
A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
We give a complete conjectural formula for the number er (d, m) of maximum possible F q-
rational points on a projective algebraic variety defined by r linearly independent …
rational points on a projective algebraic variety defined by r linearly independent …
Superhypercode and Superhyperfloorplan
T Fujita - … and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough …, 2025 - books.google.com
This paper explores extensions of Binary Code, Gray Code, and Floorplan using the
frameworks of hyperstructures and superhyperstructures. Binary codes are subsets of fixed …
frameworks of hyperstructures and superhyperstructures. Binary codes are subsets of fixed …
A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
We give a complete conjectural formula for the number $ e_r (d, m) $ of maximum possible
${\mathbb {F}} q $-rational points on a projective algebraic variety defined by $ r $ linearly …
${\mathbb {F}} q $-rational points on a projective algebraic variety defined by $ r $ linearly …