English
Related papers

Related papers: Type IV-II codes over Z4 constructed from generali…

200 papers

We study the functional codes $C_2(X)$ defined on a projective variety $X$, in the case where $X \subset {\mathbb{P}}^3$ is a non-degenerate hermitian surface. We first give some bounds for $# X_{Z(\mathcal{Q})}(\mathbb{F}_{q})$, which are…

Algebraic Geometry · Mathematics 2007-05-23 Frederic A. B. Edoukou

We study the functional codes of second order defined by G. Lachaud on $\mathcal{X} \subset {\mathbb{P}}^4(\mathbb{F}_q)$ a quadric of rank($\mathcal{X}$)=3,4,5 or a non-degenerate hermitian variety. We give some bounds for %$#…

Algebraic Geometry · Mathematics 2007-05-23 Frederic A. B. Edoukou

We introduce new families of quantum Tanner codes, a class of quantum codes that first appeared in the work of Leverrier and Z\'emor (FOCS 2022). These codes are built from two classical Tanner codes, for which the underlying graphs are…

Quantum Physics · Physics 2025-11-18 Virgile Guémard , Gilles Zémor

We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…

Number Theory · Mathematics 2011-11-11 Noam D. Elkies , Scott Duke Kominers

We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…

Algebraic Geometry · Mathematics 2007-05-23 Frederic A. B. Edoukou

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

In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive…

Combinatorics · Mathematics 2016-11-16 Markus Grassl , Masaaki Harada

Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…

Information Theory · Computer Science 2018-08-14 Sihem Mesnager , Ahmet Sınak

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

For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

Recently some mixed alphabet rings are involved in constructing few-Lee weight additive codes with optimal or minimal Gray images using suitable defining sets or down-sets. Inspired by these works, we choose the mixed alphabet ring…

Information Theory · Computer Science 2022-06-07 Pramod Kumar Kewat , Nilay Kumar Mondal

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

Information Theory · Computer Science 2017-12-05 Hongwei Liu , Youcef Maouche

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…

Information Theory · Computer Science 2016-02-05 Chunming Tang , Can Xiang , Keqin Feng

New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and the minimum distance are studied. Using these constructions…

Information Theory · Computer Science 2008-01-22 J. Pujol , J. Rifá , F. I. Solov'eva

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 2015-03-13 Mingzhi Zhu , Gennian Ge

Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic…

Information Theory · Computer Science 2016-04-20 Yun Fan , Liang Zhang

We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…

Information Theory · Computer Science 2025-12-22 Andrea Di Giusto , Elisa Gorla , Alberto Ravagnani

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…

Combinatorics · Mathematics 2007-07-16 E. M. Rains , N. J. A. Sloane

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…

Information Theory · Computer Science 2022-11-03 Reza Dastbasteh , Petr Lisonek

The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…

Information Theory · Computer Science 2017-02-15 Gaopeng Jian
‹ Prev 1 3 4 5 6 7 10 Next ›