English
Related papers

Related papers: Further Results on Homogeneous Two-Weight Codes

200 papers

Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that…

Combinatorics · Mathematics 2021-07-22 Catherine Babecki

In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…

Symbolic Computation · Computer Science 2024-04-09 Thibaut Verron

The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…

Information Theory · Computer Science 2016-02-03 Takahiro Ota , Akiko Manada , Hiroyoshi Morita

The extended weight semigroup of a homogeneous space G/H of a connected semisimple algebraic group G characterizes the spectra of the representations of G on the spaces of regular sections of homogeneous linear bundles over G/H, including…

Representation Theory · Mathematics 2011-11-15 Roman Avdeev

We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…

Data Structures and Algorithms · Computer Science 2021-01-01 Katarzyna Paluch , Mateusz Wasylkiewicz

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

Information Theory · Computer Science 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

The introduced notion of locally-periodic two-scale convergence allows to average a wider range of microstructures, compared to the periodic one. The compactness theorem for the locally-periodic two-scale convergence and the…

Analysis of PDEs · Mathematics 2012-09-19 Mariya Ptashnyk

Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs that arise from 2-weight codes. One of these new graphs is…

Combinatorics · Mathematics 2020-10-02 Dean Crnković , Andrea Švob , Vladimir D. Tonchev

In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals of vertex-weighted oriented unicyclic graphs. These formulas are in function of the weight of the vertices, the numbers of edges. We…

Commutative Algebra · Mathematics 2023-09-20 Guangjun Zhu , Hong Wang

We investigate the injectivity of the Frobenius map on thickenings of smooth varieties in projective space over a field of positive characteristic. We obtain uniform bounds -- i.e., independent of the characteristic -- on the thickening…

Algebraic Geometry · Mathematics 2023-07-10 Bhargav Bhatt , Manuel Blickle , Gennady Lyubeznik , Anurag K. Singh , Wenliang Zhang

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…

Information Theory · Computer Science 2015-12-24 Qiuyan Wang , Fei Li , Dongdai Lin

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

Metric Geometry · Mathematics 2017-05-17 Derek Kitson , Stephen Power

In this paper, we study the linear codes over the commutative ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$ and their Gray images, where $v^{3}=v$. We define the Lee weight of the elements of $R$, we give a Gray map from $R^{n}$ to $\F^{3n}_{q}$ and…

Information Theory · Computer Science 2015-05-01 A. Melakheso , K. Guenda

Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…

Combinatorics · Mathematics 2026-02-27 Tatiana Dovzhenok

Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumerators are proved. Two…

Rings and Algebras · Mathematics 2013-07-12 Bahattin Yildiz , Suat Karadeniz

Recently, it was shown that a rich class of second-order (maximally) superintegrable systems has an underpinning Hesse-Frobenius structure, i.e.\ a Frobenius structure that is compatible with a Hessian structure such that the Hessian…

Mathematical Physics · Physics 2026-05-12 Andreas Vollmer

In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…

Information Theory · Computer Science 2021-07-07 Canze Zhu , Qunying Liao

Cyclic codes with two zeros and their dual codes as a practically and theoretically interesting class of linear codes, have been studied for many years. However, the weight distributions of cyclic codes are difficult to determine. From…

Information Theory · Computer Science 2015-03-19 Baocheng Wang , Chunming Tang , Yanfeng Qi , Yixian Yang , Maozhi Xu

We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…

Probability · Mathematics 2025-06-10 Alastair Haig , Minmin Wang
‹ Prev 1 8 9 10 Next ›