RUS  ENG
Full version
JOURNALS // Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki // Archive

Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2014 Volume 156, Book 3, Pages 132–141 (Mi uzku1273)

This article is cited in 1 paper

On linear operators injective on arbitrary subsets

A. V. Chashkin

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow, Russia

Abstract: Linear operators that are injective on subsets of a linear space over $GF(p)$ are considered. Given any positive constant $\varepsilon$ and sufficiently large $n$, for any domain $D$ from $GF^n(p)$, there exists a linear operator injective on this domain whose rank is at most $(2+\varepsilon)\log_p|D|$ and whose complexity is $\mathcal O(n)$.

Keywords: perfect linear hashing, circuits of functional elements, circuit complexity.

UDC: 519.7

Received: 14.08.2014



© Steklov Math. Inst. of RAS, 2024