English
Related papers

Related papers: Note on the residue codes of self-dual $\mathbb{Z}…

200 papers

For nonnegative integers $n,d,w$, let $A(n,d,w)$ be the maximum size of a code $C \subseteq \mathbb{F}_2^n$ with constant weight $w$ and minimum distance at least $d$. We consider two semidefinite programs based on quadruples of code words…

Combinatorics · Mathematics 2019-06-12 Sven Polak

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 a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…

Information Theory · Computer Science 2017-01-05 Yan Liu , Minjia Shi , Patrick Solé

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 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

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu

In this paper we construct a new optimal code with parameters [120, 60, 20] of type II with an automorphism of order 29. Furthermore we classify all extremal codes with length 60 of type I with an automorphism of this order.

Information Theory · Computer Science 2014-05-20 Javier De la Cruz , Ismael Gutierrez , Jorge Robinson

Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…

Combinatorics · Mathematics 2022-12-07 Valentino Smaldore

We establish the existence of optimal maximal entanglement entanglement-assisted quantum $[[n,k,d;n-k]]_2$ codes for $(n,k,d)=(14,6,7)$, $(15,7,7)$, $(17,6,9)$, $(17,7,8)$, $(19,7,9)$ and $(20,7,10)$. These codes are obtained from…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

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

The structure of binary self-dual codes invariant under the action of a cyclic group of order $pq$ for odd primes $p\neq q$ is considered. As an application we prove the nonexistence of an extremal self-dual $[96, 48, 20]$ code with an…

Information Theory · Computer Science 2016-05-03 Stefka Bouyuklieva , Wolfgang Willems , Nikolay Yankov

In a {\em locally recoverable} or {\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed…

Information Theory · Computer Science 2016-11-17 Viveck Cadambe , Arya Mazumdar

Kim et al. (2021) gave a method to embed a given binary $[n,k]$ code $\mathcal{C}$ $(k = 3, 4)$ into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d' \ge d(\mathcal{C})$. We extend this…

Information Theory · Computer Science 2022-06-28 Jon-Lark Kim , Whan-Hyuk Choi

Let $C$ be an extremal self-dual binary code of length 72 and $g\in \Aut(C) $ be an automorphism of order 2. We show that $C$ is a free $\F_2<g>$ module and use this to exclude certain subgroups of order 8 of $\Aut (C)$. We also show that…

Information Theory · Computer Science 2011-12-01 Gabriele Nebe

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

Information Theory · Computer Science 2014-06-06 Nesibe Tufekci , Bahattin Yildiz

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem…

Information Theory · Computer Science 2014-10-03 Wei Hengjia , Zhang Hui , Zhu Mingzhi , Ge Gennian

The bilateral minimum distance of a binary linear code is the maximum $d$ such that all nonzero codewords have weights between $d$ and $n-d$. Let $Q\subset \{0,1\}^n$ be a binary linear code whose dual has bilateral minimum distance at…

Information Theory · Computer Science 2017-07-12 Louay Bazzi

In this work, we present a number of generator matrices of the form $[I_{2n} \ | \ \tau_k(v)],$ where $I_{kn}$ is the $kn \times kn$ identity matrix, $v$ is an element in the group matrix ring $M_2(R)G$ and where $R$ is a finite commutative…

Information Theory · Computer Science 2021-02-26 Adrian Korban , Serap Sahinkaya , Deniz Ustun

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

Combinatorics · Mathematics 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…

Information Theory · Computer Science 2026-01-16 Monika Yadav , Anuradha Sharma
‹ Prev 1 8 9 10 Next ›