Related papers: Perfect Hermitian rank-metric codes
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
We study complex non-K\"ahler manifolds with Hermitian metrics being locally conformal to metrics with special cohomological properties. In particular, we provide examples where the existence of locally conformal holomorphic-tamed…
We obtain the generic complete eigenstructures of complex Hermitian $n\times n$ matrix pencils with rank at most $r$ (with $r\leq n$). To do this, we prove that the set of such pencils is the union of a finite number of bundle closures,…
Motivated by Xing's method [7], we show that there exist [n,k,d] linear Hermitian codes over F_{q^2} with k+d>=n-3 for all sufficiently large q. This improves the asymptotic bound of Algebraic-Geometry codes from Hermitian curves given in…
We investigate the class of completely regular codes in graphs with a distance partition C_0,..., C_\rho, where each set C_i, for 0<=i<=r-1, is an independent set. This work focuses on the existence problem for such codes in the…
We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.
An attempt has been made to carry out a detailed analysis of quark mass matrices having structure beyond the minimal texture. In particular, keeping in mind, precision measurements of CKM parameters as well as refinements in the ranges of…
The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…
We study a singular Hermitian metric of a vector bundle. First, we prove the sheaf of locally square integrable holomorphic sections of a vector bundle with a singular Hermitian metric, which is a higher rank analogy of a multiplier ideal…
This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…
In this paper we consider the existence of nontrivial perfect codes in the Johnson graph J(n,w). We present combinatorial and number theory techniques to provide necessary conditions for existence of such codes and reduce the range of…
We consider constructions of covering-radius-1 completely regular codes, or, equivalently, equitable 2-partitions (regular 2-partitions, perfect 2-colorings), of halved n-cubes. Keywords: completely regular code, equitable partition,…
A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the…
Criterions for constancy of the holomorphic sectional curvature and the antiholomorphic sectional curvature are proved for almost Hermitian manifolds. It is shown, that an almost Hermitian manifold satisfying the axiom of antiholomorphic…
We introduce a nonsymmetric real matrix which contains all the information that the usual Hermitian density matrix does, and which has exactly the same tensor product structure. The properties of this matrix are analyzed in detail in the…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes…
We introduce the class of rank-metric geometric lattices and initiate the study of their structural properties. Rank-metric lattices can be seen as the $q$-analogues of higher-weight Dowling lattices, defined by Dowling himself in 1971. We…