English
Related papers

Related papers: All binary linear codes that are invariant under $…

200 papers

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

We present a family of quantum stabilizer codes using the structure of duadic constacyclic codes over $\mathbb{F}_4$. Within this family, quantum codes can possess varying dimensions, and their minimum distances are lower bounded by a…

Information Theory · Computer Science 2024-05-28 Reza Dastbasteh , Josu Etxezarreta Martinez , Andrew Nemec , Antonio deMarti iOlius , Pedro Crespo Bofill

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Dynamical Systems · Mathematics 2015-03-31 Simone Ugolini

An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…

Information Theory · Computer Science 2025-06-16 Gerardo Vega , Félix Hernández

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic…

Quantum Physics · Physics 2023-08-01 Renyu Wang , Hsiang-Ku Lin , Leonid P. Pryadko

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

Let $T_n(q)$ be the ring of lower triangular matrices of order $n \geq 2$ with entries from the finite field $F(q)$ of order $q \geq 2$ and let ${^2T_n(q)}$ denote its free left module. For $n=2,3$ it is shown that the projective line over…

Rings and Algebras · Mathematics 2019-11-12 Edyta Bartnicka , Metod Saniga

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

Invariants of 3-manifolds from a non semi-simple category of modules over a version of quantum sl(2) were obtained by the last three authors in [arXiv:1404.7289]. In their construction the quantum parameter $q$ is a root of unity of order…

Geometric Topology · Mathematics 2014-05-15 Christian Blanchet , Francesco Costantino , Nathan Geer , Bertrand Patureau-Mirand

The n-dimensional projective group gives rise to a one-parameter family of inhomogeneous first-order differential operator representations of sl(n+1). By partially swapping differential operators and multiplication operators, we obtain more…

Representation Theory · Mathematics 2014-03-31 Xiaoping Xu

In this paper, necessary and sufficient conditions for a cyclic code of arbitrary length over the non-chain rings $Z_{4}+\nu Z_{4}$ for $\nu^{2} \in \{0,1,\nu,2\nu,3\nu,2+\nu,2+3\nu,3+2\nu\}$ to be a reversible cyclic code have been…

Information Theory · Computer Science 2023-04-07 Nikita Jain , Sucheta Dutt , Ranjeet Sehmi

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…

Information Theory · Computer Science 2026-04-02 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino , Alessandro Neri

An explicit construction of a family of binary LDPC codes called LU(3,q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The…

Information Theory · Computer Science 2007-12-04 Peter Sin , Qing Xiang

Extended variants of the recently introduced spread unary coding are described. These schemes, in which the length of the code word is fixed, allow representation of approximately n^2 numbers for n bits, rather than the n numbers of the…

Information Theory · Computer Science 2015-02-04 Subhash Kak

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

Information Theory · Computer Science 2016-07-19 Antti Laaksonen , Patric R. J. Östergård

We detail an explicit construction of ordinary irreducible representations for the family of finite groups $SL_2({\mathbb Z} /p^n {\mathbb Z})$ for odd primes $p$ and $n\geq 2$. For $n=2$, the construction is a complete set of irreducible…

Representation Theory · Mathematics 2018-11-08 Benjamin K. Breen , Daryl R. Deford , Jason D. Linehan , Daniel N. Rockmore

In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…

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

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

Combinatorics · Mathematics 2025-09-23 Alexander Dunaykin , Vyacheslav Zhukov

The powers of 3 generate half of the odd residues mod 2^k (k>2), and a sign change yields the other half. In other words: 3 is a semi-primitive root of 1 mod 2^k (k>2). Hence each k-bit residue is n = +/- 3^i.2^j mod 2^k, with unique…

General Mathematics · Mathematics 2007-05-23 N. F. Benschop

There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma