English
Related papers

Related papers: How to Expand a Self-orthogonal Code

200 papers

Let $\Sigma$ be a codimension one submanifold of an $n$-dimensional Riemannian manifold $M$, $n\geqslant 2$. We give a necessary condition for an isometric immersion of $\Sigma$ into $\mathbb R^q$ equipped with the standard Euclidean…

Differential Geometry · Mathematics 2016-08-23 Norbert Hungerbühler , Micha Wasem

We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal.…

Combinatorics · Mathematics 2019-03-06 Dean Crnkovic , Sanja Rukavina , Andrea Svob

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

Number Theory · Mathematics 2016-09-27 Mokshi Goyal , Madhu Raka

It is shown that the classical quadratic and cubic transformation identities satisfied by the hypergeometric function ${}_3F_2$ can be extended to include additional parameter pairs, which differ by integers. In the extended identities,…

Classical Analysis and ODEs · Mathematics 2023-02-15 Robert S. Maier

We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…

Combinatorics · Mathematics 2015-06-09 Denis S. Krotov , Evgeniya V. Sotnikova

Solving large-scale eigenvalue problems poses a significant challenge due to the computational complexity and limitations on the parallel scalability of the orthogonalization operation, when many eigenpairs are required. In this paper, we…

Numerical Analysis · Mathematics 2025-11-11 Tianyang Chu , Xiaoying Dai , Shengyue Wang , Aihui Zhou

We are interested in the asymptotic behavior of orthogonal polynomials of the generalized Jacobi type as their degree $n$ goes to $\infty$. These are defined on the interval $[-1,1]$ with weight function…

Mathematical Software · Computer Science 2015-10-23 Alfredo Deaño , Daan Huybrechs , Peter Opsomer

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Metric Geometry · Mathematics 2024-11-21 David Hume

We study the self-adjoint extensions of the Hamiltonian operator with symmetric potentials which go to $-\infty$ faster than $-|x|^{2p}$ with $p>1$ as $x\to\pm\infty$. In this extension procedure, one requires the Wronskian between any…

Quantum Physics · Physics 2009-11-13 Hing-Tong Cho , Choon-Lin Ho

It is possible to have a packing by translates of a cube that is maximal (i.e.\ no other cube can be added without overlapping) but does not form a tiling. In the long running analogy of packing and tiling to orthogonality and completeness…

Classical Analysis and ODEs · Mathematics 2025-03-27 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order $p^2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic…

Information Theory · Computer Science 2013-12-23 Akshay Degwekar , Kenza Guenda , T. Aaron Gulliver

In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…

Information Theory · Computer Science 2016-10-26 Minjia Shi , Lin Sok , Patrick Solé

A code of length $n$ is said to be (combinatorially) $(\rho,L)$-list decodable if the Hamming ball of radius $\rho n$ around any vector in the ambient space does not contain more than $L$ codewords. We study a recently introduced class of…

Information Theory · Computer Science 2023-05-10 Harshithanjani Athi , Rasagna Chigullapally , Prasad Krishnan , Lalitha Vadlamani

The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended…

Information Theory · Computer Science 2023-12-05 Zhonghua Sun , Cunsheng Ding , Tingfang Chen

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…

Information Theory · Computer Science 2026-05-25 Gustavo Terra Bastos , Angelynn Álvarez , Cameron Williams

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Optimization and Control · Mathematics 2022-10-21 Pavel Chebotarev

Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$…

Combinatorics · Mathematics 2019-10-08 Simona Boyadzhiyska , Shagnik Das , Tibor Szabó

In this paper, we further investigate the constructions on three-dimensional $(u\times v\times w,k,1)$ optical orthogonal codes with the at most one optical pulse per wavelength/time plane restriction (briefly AM-OPP $3$-D $(u\times v\times…

Information Theory · Computer Science 2016-02-26 Lidong Wang , Yanxun Chang

In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…

Information Theory · Computer Science 2020-01-07 Jingjie Lv , Ruihu Li , Junli Wang

$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…

Number Theory · Mathematics 2024-03-05 Zhaonan Wang , Yingpu Deng
‹ Prev 1 4 5 6 7 8 10 Next ›