English
Related papers

Related papers: Mass formula for self-orthogonal codes over Z_{p^2…

200 papers

There has been much research on codes over $\mathbb{Z}_4$, sometimes called quaternary codes, for over a decade. Yet, no database is available for best known quaternary codes. This work introduces a new database for quaternary codes. It…

Information Theory · Computer Science 2015-05-14 Nuh Aydin , Tsvetan Asamov

By designating one eigenvector of the mass matrix, one can reduce the free parameters in the mass matrix effectively. Applying this method to the quark mass matrix and to the lepton mass matrix, we find that this method is consistent with…

High Energy Physics - Phenomenology · Physics 2008-11-26 Zhi-Qiang Guo , Bo-Qiang Ma

A new option of parameter constraint is described for the recently proposed neutrino mass formula involving primarily three free parameters. The option implies the vanishing of a part of mass formula for the lowest mass neutrino, the part…

High Energy Physics - Phenomenology · Physics 2007-05-23 Wojciech Krolikowski

Some Open Problems Concerning Orthogonal Polynomials.

Classical Analysis and ODEs · Mathematics 2016-12-06 Gökalp Alpan , Alexander Goncharov

The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials…

Mathematical Physics · Physics 2018-02-14 A. D. Alhaidari

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…

Information Theory · Computer Science 2021-02-22 Whan-Hyuk Choi , Jon-Lark Kim

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…

Information Theory · Computer Science 2012-03-05 Sophie Morier-Genoud , Valentin Ovsienko

Kim et al. (2021) gave a method to embed a given binary $[n,k]$ code $\mathcal{C}$ $(k = 3, 4)$ into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d' \ge d(\mathcal{C})$. We extend this…

Information Theory · Computer Science 2022-06-28 Jon-Lark Kim , Whan-Hyuk Choi

We assume that all quark and lepton mass matrices have upper triangular form. Using all available experimental data on quark and lepton masses and mixing angles we make a fit in which we determine mass matrices elements. There are too many…

High Energy Physics - Phenomenology · Physics 2008-12-19 Stanislaw Tatur , Jan Bartelski

In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…

Functional Analysis · Mathematics 2007-05-23 T. Constantinescu

We give formulas for the density of the measure of orthogonality for orthonormal polynomials with unbounded recurrence coefficients. The formulas involve limits of appropriately scaled Tur\'an determinants or Christoffel functions. Exact…

Classical Analysis and ODEs · Mathematics 2017-02-07 Grzegorz Świderski

In this paper we obtain $L^1$-weighted norms of classical orthogonal polynomials (Hermite, Laguerre and Jacobi polynomials) in terms of the zeros of these orthogonal polynomials; these expressions are usually known as quadrature rules. In…

Classical Analysis and ODEs · Mathematics 2014-07-11 Luciano Abadias , Pedro J. Miana , Natalia Romero

The orthogonal polynomials $p_n$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give general criteria for orthogonal polynomials to satisfy Tur\'an's…

Classical Analysis and ODEs · Mathematics 2007-10-19 Ryszard Szwarc

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

Combinatorics · Mathematics 2018-04-20 Alessio Meneghetti

In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod…

Number Theory · Mathematics 2015-02-17 Pedro Berrizbeitia , Florian Luca , Alberto Mendoza

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…

Information Theory · Computer Science 2012-02-07 Sunghyu Han , Jon-Lark Kim

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

Combinatorics · Mathematics 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…

Classical Analysis and ODEs · Mathematics 2012-10-16 Wolter Groenevelt , Erik Koelink

Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing…

Combinatorics · Mathematics 2024-07-09 Dean Crnković , Keita Ishizuka , Hadi Kharaghani , Sho Suda , Andrea Švob