English
Related papers

Related papers: Constructions of Polyphase Golay Complementary Arr…

200 papers

A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…

Commutative Algebra · Mathematics 2007-05-23 Ragnar-Olaf Buchweitz , Graham J. Leuschke

We apply a systematic inverse design approach to discover foundry-compliant, multilayer grating couplers that can efficiently couple a number of independent waves from free space to on-chip propagating modes. For visible- and near-infrared…

Optics · Physics 2026-05-01 Hao Li , Nazar Pyvovar , Zhaowei Dai , Owen D. Miller

We show how certain F^4 couplings in eight dimensions can be computed using the mirror map and K3 data. They perfectly match with the corresponding heterotic one-loop couplings, and therefore this amounts to a successful test of the…

High Energy Physics - Theory · Physics 2010-11-26 W. Lerche , S. Stieberger , N. P. Warner

Goppa codes are particularly appealing for cryptographic applications. Every improvement of our knowledge of Goppa codes is of particular interest. In this paper, we present a sufficient and necessary condition for an irreducible monic…

Information Theory · Computer Science 2021-07-23 Xia Li , Qin Yue , Daitao Huang

A finitely generated module $M$ over a local ring is called a sequentially generalized Cohen-Macaulay module if there is a filtration of submodules of $M$: $M_0\subset M_1\subset ... \subset M_t=M$ such that $\dim M_0<\dim M_1< >... <\dim…

Commutative Algebra · Mathematics 2007-05-23 Nguyen Tu Cuong , Doan Trung Cuong

A covering array $t$-$CA(n,k,g)$, of size $n$, strength $t$, degree $k$, and order $g$, is a $k\times n$ array on $g$ symbols such that every $t\times n$ sub-array contains every $t\times 1$ column on $g$ symbols at least once. Covering…

Discrete Mathematics · Computer Science 2015-12-31 Soumen Maity , Yasmeen Akhtar , Reshma C Chandrasekharan , Charles J Colbourn

This research focuses on constructing $q$-ary functions for complete complementary codes (CCCs) with flexible parameters. Most existing work has primarily identified sufficient conditions for $q$-ary functions related to $q$-ary CCCs. To…

Combinatorics · Mathematics 2024-09-24 Palash Sarkar , Chunlei Li , Sudhan Majhi , Zilong Liu

Supporting multiple partial computations efficiently at each of the workers is a keystone in distributed coded computing in order to speed up computations and to fully exploit the resources of heterogeneous workers in terms of…

Information Theory · Computer Science 2024-11-25 Jesús Gómez-Vilardebó , Burak Hasırcıoğlu , Deniz Gündüz

This letter presents an innovative design and implementation method for an ultra-wideband dual-polarized conformal phased array. The performance of single-layer continuous dipoles under bending conditions is evaluated through characteristic…

Information Theory · Computer Science 2024-08-07 Zhan Chen , Wei Hu , Yuchen Gao , Xiangbo Wang , Qi Luo

This paper contains a preliminary study of the monodromy of certain fourth order differential equations, that were called of Calabi-Yau type in math.NT/0402386. Some of these equations can be interpreted as the Picard-Fuchs equations of a…

Algebraic Geometry · Mathematics 2007-05-23 Christian van Enckevort , Duco van Straten

Linear complementary dual (LCD) codes, which is a class of linear codes introduced by Massey, have been extensively studied in literature recently. It has been shown that LCD codes can help to improve the security of the information…

Information Theory · Computer Science 2020-10-21 Liangdong Lu , Xiuzhen Zhan , Sen Yang , Hao Cao

An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…

Combinatorics · Mathematics 2025-10-16 S. A. Mane , N. V. Shinde

Let $(R,\fm)$ be a local ring and $C$ be a homologically bounded and finitely generated $R$-complex. Then, we prove that $C$ is a dualizing complex of $R$ if and only if $C$ is a Cohen-Macaulay semidualizing complex of type one or…

Commutative Algebra · Mathematics 2023-05-18 Majid Rahro Zargar

In this paper, we propose a direct construction of optimal two-dimensional Z-complementary array code sets (2D-ZCACS) using multivariable functions (MVFs). In contrast to earlier works, the proposed construction allows for a flexible array…

Information Theory · Computer Science 2023-01-09 Gobinda Ghosh , Sudhan Majhi , Shubhabrata Paul

Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…

Computational Complexity · Computer Science 2026-01-29 Robert Andrews , Mrinal Kumar , Shanthanu S. Rai

Hybrid analog-digital precoding is challenging for broadband millimeter-wave (mmWave) massive MIMO systems, since the analog precoder is frequency-flat but the mmWave channels are frequency-selective. In this paper, we propose a principal…

Information Theory · Computer Science 2020-06-12 Yiwei Sun , Zhen Gao , Hua Wang , Byonghyo Shim , Guan Gui , Guoqiang Mao , Fumiyuki Adachi

Cross Z-complementary pairs (CZCPs) are a special kind of Z-complementary pairs (ZCPs) having zero autocorrelation sums around the in-phase position and end-shift position, also having zero cross-correlation sums around the end-shift…

Information Theory · Computer Science 2021-12-30 Hui Zhang , Cuiling Fan , Sihem Mesnager

Background: The integration and analysis of multi-modal data are increasingly essential across various domains including bioinformatics. As the volume and complexity of such data grow, there is a pressing need for computational models that…

Machine Learning · Statistics 2025-04-17 Tianjian Yang , Wei Vivian Li

We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of…

Symbolic Computation · Computer Science 2017-01-08 Paola Boito , Olivier Ruatta

Over Cohen--Macaulay rings admitting a pointwise dualizing module, we show that the class of modules of restricted projective dimension bounded by any integer is finitely deconstructible and that the class of modules of restricted flat…

Commutative Algebra · Mathematics 2025-08-29 Souvik Dey , Michal Hrbek , Giovanna Le Gros
‹ Prev 1 3 4 5 6 7 10 Next ›