In this paper, the Sphere-packing bound, Singleton bound, Wang–Xing–Safavi-Naini bound, Johnson bound and Gilbert–Varshamov bound on the subspace codes [Formula: see text] based on [Formula: see text]-dimensional totally isotropic subspaces in unitary space [Formula: see text] over finite fields [Formula: see text] are presented. Then, we prove that [Formula: see text] codes based on [Formula: see text]-dimensional totally isotropic subspaces in unitary space [Formula: see text] attain the Wang–Xing–Safavi-Naini bound if and only if they are certain Steiner structures in [Formula: see text].
Linear code with locality [Formula: see text] and availability [Formula: see text] is that the value at each coordinate [Formula: see text] can be recovered from [Formula: see text] disjoint repairable sets each containing at most [Formula: see text] other coordinates. This property is particularly useful for codes in distributed storage systems because it permits local repair of failed nodes and parallel access of hot data. In this paper, two constructions of [Formula: see text]-locally repairable linear codes based on totally isotropic subspaces in symplectic space [Formula: see text] over finite fields [Formula: see text] are presented. Meanwhile, comparisons are made among the [Formula: see text]-locally repairable codes we construct, the direct product code in Refs. [8], [11] and the codes in Ref. [9] about the information rate [Formula: see text] and relative distance [Formula: see text].
Two orthonormal bases [Formula: see text] and [Formula: see text] of a [Formula: see text]-dimensional complex inner-product space [Formula: see text] are called mutually unbiased bases (MUBs) if and only if [Formula: see text] holds for all [Formula: see text] and [Formula: see text]. The size of any set containing pairwise MUBs of [Formula: see text] cannot exceed [Formula: see text]. If [Formula: see text] is a power of a prime, then extremal sets containing [Formula: see text] MUBs are known to exist, which are called the complete MUBs of [Formula: see text]. We have not known whether there exist complete MUBs when [Formula: see text] is not a power of a prime so far. Therefore, many researchers focus their attention on approximately mutually unbiased bases (AMUB). In this paper, two new constructions of AMUB of [Formula: see text] are provided based on the mixed character sum of two special kinds of functions over finite fields.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.