English
Related papers

Related papers: Simplex and MacDonald Codes over $R_{q}$

200 papers

We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…

Information Theory · Computer Science 2019-02-15 Carlos Galindo , Fernando Hernando , Ryutaroh Matsumoto

In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory…

Information Theory · Computer Science 2025-04-18 Zhiyong Zheng , Fengxia Liu , Kun Tian

The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets,…

Rings and Algebras · Mathematics 2011-10-10 Marcus Greferath , Cathy Mc Fadden , Jens Zumbrägel

Let $p$ be an odd prime and $\F_q$ be the finite field with $q=p^n$ elements. A planar function $f:\F_q\rightarrow\F_q$ is called homogenous if $f(\lambda x)=\lambda^df(x)$ for all $\lambda\in\F_p$ and $x\in\F_q$, where $d$ is some fixed…

Number Theory · Mathematics 2013-12-17 Tao Feng

In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…

Information Theory · Computer Science 2015-11-10 Can Xiang , Keqin Feng , Chunming Tang

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…

Commutative Algebra · Mathematics 2007-05-23 Zhongming Tang , Zhe-xian Wan

The homogeneous weights and the M\"obius functions and Euler phi-functions on finite rings are discussed; some computational formulas for these functions on finite principal ideal rings are characterized; for the residue rings of integers,…

Information Theory · Computer Science 2013-04-18 Yun Fan , Hongwei Liu

Let $k$ be a field of characteristic zero and $R$ a $k$-algebra. In this paper we study homogeneous $R$-lnds $D$ on $R[X,Y,Z]$ with respect to the standard weights $(1,1,1)$. We show that when $R$ is a PID, $rank(D)$ can be at most $2$ if…

Commutative Algebra · Mathematics 2024-03-22 Parnashree Ghosh

In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$…

Information Theory · Computer Science 2020-06-23 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…

Combinatorics · Mathematics 2007-07-16 E. M. Rains , N. J. A. Sloane

For the rational group algebra $\mathbb{Q}G$ of a finite group $G$, we provide an effective method to compute a complete set of matrix units and, in particular, primitive orthogonal idempotents in a simple component of $\mathbb{Q}G$, which…

Rings and Algebras · Mathematics 2024-06-17 Gurmeet Kaur Bakshi , Jyoti Garg

Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…

Information Theory · Computer Science 2024-08-20 Xu Pan , Hao Chen , Hongwei Liu , Shengwei Liu

We construct a new family of graded representations $\widetilde{W}_{\lambda}$ for the positive elliptic Hall algebra $\mathcal{E}^{+}$ indexed by Young diagrams $\lambda$ which generalize the standard $\mathcal{E}^{+}$ action on symmetric…

Combinatorics · Mathematics 2024-05-03 Milo Bechtloff Weising

This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…

Information Theory · Computer Science 2019-09-06 Elisa Gorla , Relinde Jurrius , Hiram H. López , Alberto Ravagnani

Let $k \leq n$ be nonnegative integers and let $\lambda$ be a partition of $k$. S. Griffin recently introduced a quotient $R_{n,\lambda}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which simultaneously generalizes…

Combinatorics · Mathematics 2020-04-03 Brendon Rhoades , Tianyi Yu , Zehong Zhao

In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 = u are considered. A duality and distance preserving Gray map from F2 + uF2 + u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic bordered…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…

Information Theory · Computer Science 2017-07-25 Ziling Heng , Qin Yue

In this work, we define a modification of a bordered construction for self-dual codes which utilises $\lambda$-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative…

Information Theory · Computer Science 2023-01-18 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

Let $\mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k$ is an integer satisfying $k\geq 2$. For any odd…

Information Theory · Computer Science 2019-10-08 Yonglin Cao , Yuan Cao , Fang-Wei Fu

In this paper, we mainly study the some structure of cyclic DNA codes of odd length over the ring $R = \F_2[u,v]/\langle u^2-1,v^3-v,uv-vu \rangle$ which play an important role in DNA computing. We established a direct link between the…

Information Theory · Computer Science 2015-11-13 Sukhamoy Pattanayak , Abhay Kumar Singh , Pratyush Kumar