English
Related papers

Related papers: Some constructions of cyclic and quasi-cyclic subs…

200 papers

Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…

Information Theory · Computer Science 2016-08-11 Ismael Gutierrez Garcia , Ivan Molina Naizir

Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…

Information Theory · Computer Science 2020-12-10 Cem Güneri , San Ling , Buket Özkaya

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

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

This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.

Information Theory · Computer Science 2016-07-27 Kenza Guenda , T. Aaron Gulliver

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration…

Information Theory · Computer Science 2016-03-17 Jean-Claude Belfiore , Cem Güneri , Buket Özkaya

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…

Information Theory · Computer Science 2025-07-15 Chiara Castello , Paolo Santonastaso

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

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

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…

Information Theory · Computer Science 2007-07-16 Eric Zhi Chen

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

Information Theory · Computer Science 2019-03-27 Martino Borello , Cem Güneri , Elif Saçıkara , Patrick Solé

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…

Information Theory · Computer Science 2013-07-09 Jian Gao , Fang-Wei Fu , Linzhi Shen

In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…

Information Theory · Computer Science 2017-09-25 Mehmet E. Koroglu , Ibrahim Ozbek , Irfan Siap

As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a…

Information Theory · Computer Science 2019-08-09 Yan Liu , Xiwang Cao

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…

Algebraic Geometry · Mathematics 2021-06-17 Gustavo Cabaña , María Chara , Ricardo A. Podestá , Ricardo Toledano

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…

Information Theory · Computer Science 2026-01-21 Kanat Abdukhalikov , Askar S. Dzhumadil'daev , San Ling

In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a…

Information Theory · Computer Science 2025-06-10 Chaofeng Guan , Ruihu Li , Jingjie Lv , Zhi Ma
‹ Prev 1 2 3 10 Next ›