1 citations · 1 across the 13 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
Philipp Heering, Christian Kaspers, Vladislav Taranchuk
A function is called th-order sum-free if the sum of its values over any -dimensional affine subspace of is non-…
cs.IT2026
Recovery Models for Linear Batch Codes
Baran Düzgün, Henk D. L. Hollmann, Ago-Erik Riet +2
Various types of recovery algorithms for batch codes have been considered previously, including asynchronous recovery and recovery algorithms arising from Almost Affinely Disjoint…