Related papers: Group Symmetries of Complementary Code Matrices
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…
In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on $\mathbb{S}_{n}(\mathbb{F}_{q})$, the space of $n\times n$ symmetric matrices over $\mathbb{F}_{q}$. Using this…
A low-energy non-unitary leptonic mixing matrix is a generic effect of some theories of new physics accounting for neutrino masses. We show how the extra CP-phases of a general non-unitary matrix allow for sizeable CP-asymmetries in the…
We analyze the possible generalized CP symmetries admitted by the Tri-Bi-Maximal (TBM) neutrino mixing. Taking advantage of these symmetries we construct in a systematic way other variants of the standard TBM ansatz. Depending on the type…
This thesis aims at concluding the classification results for topological phases with symmetry in 2+1 dimensions. The main result is that topological phases are classified by a triple of unitary braided fusion categories $\mathcal…
The quark-lepton complementarity (QLC) is very suggestive in understanding possible relations between quark and lepton mixing matrices. We explore the QLC relations in all the possible angle-phase parametrizations and point out that they…
As a generalization of the standard phase retrieval problem, we seek to reconstruct symmetric rank-1 matrices from inner products with subclasses of positive semidefinite matrices. For such subclasses, we introduce random cubatures for…
A new method of obtaining a sequence of isolated complex Hadamard matrices (CHM) for dimensions $N\geqslant 7$, based on block-circulant structures, is presented. We discuss, several analytic examples resulting from a modification of the…
We investigate the properties of neutrino mass matrices that incorporate texture zeros and generalized CP symmetries associated with tribimaximal mixing. By combining these approaches, we derive predictive neutrino mass matrices and explore…
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…
This paper is devoted to the study of the construction of new quantum MDS codes. Based on constacyclic codes over Fq2 , we derive four new families of quantum MDS codes, one of which is an explicit generalization of the construction given…
LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…
The aim of the paper is to propose a new type of fits in terms of invariant quantities for finding the entries of the CKM matrix from the quark sector, by using the mathematical solution to the reconstruction problem of 3 x 3 unitary…
Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…
The PMNS and CKM matrices are phenomenologically close to symmetric, and a symmetric form could be used as zeroth-order approximation for both matrices. We study the possible theoretical origin of this feature in flavor symmetry models. We…
This paper concerns the enumeration of isomorphism classes of modules of a polynomial algebra in several variables over a finite field. This is the same as the classification of commuting tuples of matrices over a finite field up to…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.