English
Related papers

Related papers: Double Circulant Self-Dual Codes From Generalized …

200 papers

We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.

Combinatorics · Mathematics 2023-03-15 Shoyu Nagaoka , Manabu Oura

We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the…

Combinatorics · Mathematics 2011-03-17 Lars Eirik Danielsen , Matthew G. Parker

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…

Number Theory · Mathematics 2025-06-03 José G. Coelho , F. E. Brochero Martínez

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

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

In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…

Combinatorics · Mathematics 2026-05-05 Futo Takabayashi

A Z2-triple cyclic code of block length (r,s,t) is a binary code of length r+s+t such that the code is partitioned into three parts of lengthsr,s andt such that each of the three parts is invariant under the cyclic shifts of the…

Information Theory · Computer Science 2019-06-05 B. Srinivasulu

Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…

Information Theory · Computer Science 2026-04-14 Lingqi Zheng , Weijun Fang , Rongxing Qiu

In this paper we investigate some dual algebraic-geometric codes associated with the Giulietti-Korchm\'aros maximal curve. We compute the minimum distance and the minimum weight codewords of such codes and we investigate the generalized…

Information Theory · Computer Science 2019-09-19 Edoardo Ballico , Matteo Bonini

In this note, we construct new doubly even self-dual codes having minimum weight $20$ for lengths $112$, $120$ and $128$. This implies that there are at least three inequivalent extremal doubly even self-dual codes of length $112$.

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…

Information Theory · Computer Science 2015-04-14 Eli Ben-Sasson , Tuvi Etzion , Ariel Gabizon , Netanel Raviv

Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic…

Combinatorics · Mathematics 2007-05-23 Lilibeth Dicuangco , Pieter Moree , Patrick Sole

We construct new $s$-extremal singly even self-dual codes of minimum weights $8,10,12$ and $14$. We also give tables for the currently known results on the existence of $s$-extremal singly even self-dual codes of minimum weights $8,10,12$…

Combinatorics · Mathematics 2020-08-31 Masaaki Harada

In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed)…

Combinatorics · Mathematics 2014-04-01 Ruihu Li , Xueliang Li , Yaping Mao , Meiqin Wei

Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…

Information Theory · Computer Science 2025-10-14 Qingfeng Xia , Hongwei Liu , Hao Chen , Xu Pan

Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…

Information Theory · Computer Science 2022-06-17 Fei Li

The weight distribution of the binary self-dual $[128,64]$ code being the extended code $C^{*}$ of the code $C$ spanned by the incidence vectors of the blocks of the polarity design in $PG(6,2)$ [11] is computed. It is shown also that…

Combinatorics · Mathematics 2016-08-19 Masaaki Harada , Ethan Novak , Vladimir D. Tonchev

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

Information Theory · Computer Science 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

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

Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…

Combinatorics · Mathematics 2007-07-16 Vwani P. Roychowdhury , Farrokh Vatan