English
Related papers

Related papers: Additive Tridiagonal Codes over $\mathbb{F}_{4}$

200 papers

An additive code is an $\mathbb{F}_q$-linear subspace of $\mathbb{F}_{q^m}^n$ over $\mathbb{F}_{q^m}$, which is not a linear subspace over $\mathbb{F}_{q^m}$. Linear complementary pairs (LCP) of codes have important roles in cryptography,…

Information Theory · Computer Science 2024-09-26 Sanjit Bhowmick , Deepak Kumar Dalai

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

In the present paper, we construct 3-designs using extended binary quadratic residue codes and their dual codes.

Combinatorics · Mathematics 2024-01-04 Madoka Awada , Tsuyoshi Miezaki , Akihiro Munemasa , Hiroyuki Nakasora

In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in terms of self-dual codes over the finite field $F_p$ and give an explicit construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.

Information Theory · Computer Science 2013-04-18 Guanghui Zhang , Bocong Chen

The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…

Information Theory · Computer Science 2023-06-22 Chaofeng Guan , Ruihu Li , Yiting Liu , Zhi Ma

Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…

Information Theory · Computer Science 2023-11-21 Xiaoru Li , Ziling Heng

The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes.…

General Mathematics · Mathematics 2010-07-01 W. B. Vasantha Kandasamy , Florentin Smarandache , K. Ilanthenral

In this work, we study the structure of multivariable modular codes over finite chain rings when the ambient space is a principal ideal ring. We also provide some applications to additive modular codes over the finite field $\mathbb{F}_4$.

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa

Let $\mathbb{F}_{q}$ be the finite field with $q$ elements. This paper mainly researches the polynomial representation of double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$ with $v^3=v$. Firstly, we give the…

Information Theory · Computer Science 2021-03-11 Tenghui Deng , Jing Yang

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

In this paper, we study the characters of two classes of P-polynomial table algebras using tridiagonal matrices. To this end, we obtain some results about the eigen-structure of special tridiagonal matrices. We also find a recursive…

Combinatorics · Mathematics 2019-06-17 Masoumeh Koohestani , Amir Rahnamai Barghi , Amirhossein Amiraslani

The applications of additive codes mainly lie in quantum error correction and quantum computing. Due to their applications in quantum codes, additive codes have grown in importance. In addition to this, additive codes allow the…

Information Theory · Computer Science 2024-01-03 Astha Agrawal , R. K. Sharma

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Information Theory · Computer Science 2024-05-30 Ferruh Ozbudak , Paolo Santonastaso , Ferdinando Zullo

Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…

Information Theory · Computer Science 2015-01-05 Jian Gao , Yun Gao , Fang-Wei Fu

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro

We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…

Information Theory · Computer Science 2025-11-05 Ankit Yadav , Ritumoni Sarma

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction.…

Information Theory · Computer Science 2024-11-12 Chaofeng Guan , Jingjie Lv , Gaojun Luo , Zhi Ma

A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear…

Information Theory · Computer Science 2007-10-08 J. Borges , C. Fernandez , J. Pujol , J. Rifa , M. Villanueva

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

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