English
Related papers

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

200 papers

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…

Information Theory · Computer Science 2007-11-14 Kenza Guenda

Functional bases of second-order differential invariants of the Euclid, Poincar\'e, Galilei, conformal, and projective algebras are constructed. The results obtained allow us to describe new classes of nonlinear many-dimensional invariant…

Mathematical Physics · Physics 2007-05-23 W. I. Fushchych , Irina Yehorchenko

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire

We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$. They…

Information Theory · Computer Science 2014-08-01 Yixuan Xie , Jinhong Yuan , Qifu , Sun

Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic…

Information Theory · Computer Science 2014-05-13 Bocong Chen , San Ling , Guanghui Zhang

We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data symbols using bitwise XOR and cyclic shift operations. The…

Information Theory · Computer Science 2016-05-04 Christian Schindelhauer , Andreas Jakoby , Sven Köhler

This paper investigates block-transitive automorphism groups of t-(k^2,k,\lambda) designs. Let D be a non-trivial t-(k^2,k,\lambda) design, G \leq \Aut(D) be block-transitive with X\unlhd G\leq \Aut(X), where X = PSL(2,q)(q\geq4). Then q =…

Group Theory · Mathematics 2025-08-28 Guoqiang Xiong , Haiyan Guan

Studying binary perfect codes we show the existence of homogeneous nontransitive codes. Thus, as far as perfect codes are concerned, the propelinear codes are strictly contained in transitive codes, wheresas homogeneous codes form a strict…

Combinatorics · Mathematics 2014-12-10 I. Yu. Mogilnykh , F. I. Solov'eva

In this paper, we resolve a conjecture of Green and Liebeck [Disc. Math., 343 (8):117119, 2019] on codes in $PGL(2,q)$. To be specific, we show that: if $D$ is a dihedral subgroup of order $2(q+1)$ in $G=PGL(2,q)$, and $A=\{g\in G: g^{q+1}=…

Combinatorics · Mathematics 2020-09-03 Tao Feng , Weicong Li , Jingkun Zhou

Perfect codes obtained by the Vasil'ev--Sch\"onheim construction from a linear base code and quadratic switching functions are transitive and, moreover, propelinear. This gives at least $\exp(cN^2)$ propelinear $1$-perfect codes of length…

Information Theory · Computer Science 2014-03-17 Denis Krotov , Vladimir Potapov

Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…

Information Theory · Computer Science 2021-03-26 Ziling Heng , Dexiang Li , Jiao Du , Fuling Chen

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani

In this paper the relationship between $S$-subgroups in $\Z_{2}^{n}$ and binary codes is shown. If the codes used are both $P(T)$-codes and $G$-codes, then the $S$-subgroup is free. The codes constructed are cyclic, decimated or symmetric…

Combinatorics · Mathematics 2019-06-12 Ronald Orozco López

We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford…

Quantum Physics · Physics 2021-01-06 Jeongwan Haah

Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…

Information Theory · Computer Science 2024-01-08 Ziling Heng , Xiaoru Li , Yansheng Wu , Qi Wang

Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…

Information Theory · Computer Science 2014-06-20 Joachim Rosenthal , Anna-Lena Trautmann

Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…

Information Theory · Computer Science 2024-04-30 Tingfang Chen , Zhonghua Sun , Conghui Xie , Hao Chen , Cunsheng Ding

We consider rate R = k/n causal linear codes that map a sequence of k-dimensional binary vectors {b_t} to a sequence of n-dimensional binary vectors {c_t}, such that each c_t is a function of {b_1,b_2,...,b_t}. Such a code is called anytime…

Information Theory · Computer Science 2011-06-02 Ravi Teja Sukhavasi , Babak Hassibi

A conjecture of Bondal-Polishchuk states that, in particular for the bounded derived category of coherent sheaves on a smooth projective variety, the action of the braid group on full exceptional collections is transitive up to shifts. We…

Algebraic Geometry · Mathematics 2024-08-01 Johannes Krah

Over an algebraically closed base field $k$ of characteristic 2, the ring $R^G$ of invariants is studied, $G$ being the orthogonal group O(n) or the special orthogonal group SO(n) and acting naturally on the coordinate ring $R$ of the…

Rings and Algebras · Mathematics 2014-07-31 M. Domokos , P. E. Frenkel
‹ Prev 1 4 5 6 7 8 10 Next ›