English
Related papers

Related papers: On the classification of self-dual $\mathbb{Z}_k$-…

200 papers

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

We prove configuration results for extremal Type II codes, analogous to the configuration results of Ozeki and of the second author for extremal Type II lattices. Specifically, we show that for $n \in \{8, 24, 32, 48, 56, 72, 96\}$ every…

Number Theory · Mathematics 2015-03-17 Noam D. Elkies , Scott Duke Kominers

In this paper we study $\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes. These codes are identified as $\mathbb{Z}_{2^n}[x]$-submodules of $\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}[x]/ \langle x^{\alpha_i}-1\rangle$; $\alpha_i$…

Information Theory · Computer Science 2017-08-24 Tapabrata Roy , Santanu Sarkar

For lengths $64$ and $66$, we construct extremal singly even self-dual codes with weight enumerators for which no extremal singly even self-dual codes were previously known to exist. We also construct new $40$ inequivalent extremal doubly…

Combinatorics · Mathematics 2020-11-20 Damyan Anev , Masaaki Harada , Nikolay Yankov

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

In this paper we investigate repeated root cyclic and negacyclic codes of length $p^rm$ over $\mathbb{F}_{p^s}$ with $(m,p)=1$. In the case $p$ odd, we give necessary and sufficient conditions on the existence of negacyclic self-dual codes.…

Information Theory · Computer Science 2012-07-17 Kenza Guenda , T. Aaron Gulliver

We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cyclic group codes by using cyclotomic cosets. The dimension and…

Information Theory · Computer Science 2022-01-24 Ankan Shaw , Sanjit Bhowmick , Satya Bagchi

We recently introduced a class of ${\mathbb{Z}}_N$ graded discrete Lax pairs and studied the associated discrete integrable systems (lattice equations). In particular, we introduced a subclass, which we called "self-dual". In this paper we…

Exactly Solvable and Integrable Systems · Physics 2017-07-07 Allan P. Fordy , Pavlos Xenitidis

Binary linear [n,k] codes that are proper for error detection are known for many combinations of n and k. For the remaining combinations, existence of proper codes is conjectured. In this paper, a particular class of [n,k] codes is studied…

Information Theory · Computer Science 2011-11-24 Marco Baldi , Marco Bianchi , Franco Chiaraluce , Torleiv Kløve

We give an independent proof of the Krasikov-Litsyn bound d/n<~(1-5^{-1/4})/2 on doubly-even self-dual binary codes. The technique used (a refinement of the Mallows-Odlyzko-Sloane approach) extends easily to other families of self-dual…

Combinatorics · Mathematics 2007-05-23 Eric M. Rains

For a type-I $(K,M,Z,N)$-ZCCS, it follows $K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. In this paper, we propose a construction of type-II $(p^{k+n},p^k,p^{n+r}-p^r+1,p^{n+r})$-$Z$ complementary code set (ZCCS) using an extended…

Information Theory · Computer Science 2024-05-15 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

For any positive integers $m$ and $k$, existing literature only determines the number of all Euclidean self-dual cyclic codes of length $2^k$ over the Galois ring ${\rm GR}(4,m)$, such as in [Des. Codes Cryptogr. (2012) 63:105--112]. Using…

Information Theory · Computer Science 2020-07-21 Yuan Cao , Yonglin Cao , San ling , Guidong Wang

In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of \lambda-circulant and \lambda-reverse circulant matrices. By using the constructions on…

Information Theory · Computer Science 2016-02-24 Abidin Kaya , Bahattin Yildiz , Abdullah Paşa

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…

Information Theory · Computer Science 2007-11-27 Ted Hurley

In a recent paper [M. Araya, M. Harada, Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes, Des. Codes Cryptogr., 91 (2023), 1813--1843], Araya and Harada gave…

Combinatorics · Mathematics 2024-03-07 Sanja Rukavina , Vladimir D. Tonchev

In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-02-25 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…

Information Theory · Computer Science 2012-10-09 Yun Fan , Guanghui Zhang

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

Information Theory · Computer Science 2018-07-30 Khawla Labad , Honwei Liu , Jinquan Luo

Shimada and Zhang studied the existence of polarizations on some supersingular $K3$ surfaces by reducing the existence of the polarizations to that of ternary $[12,5]$ codes satisfying certain conditions. In this note, we give a…

Combinatorics · Mathematics 2016-08-19 Makoto Araya , Masaaki Harada