English
Related papers

Related papers: On Skew Convolutional and Trellis Codes

200 papers

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of…

Information Theory · Computer Science 2024-07-11 Gaofei Wu , Zhuohui You , Zhengbang Zha , Yuqing Zhang

In this paper, we develop the theory of convolutional codes over finite commutative chain rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and we provide a characterization of these codes, generalizing…

Information Theory · Computer Science 2022-03-31 Gianira N. Alfarano , Anina Gruica , Julia Lieb , Joachim Rosenthal

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

Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is…

Information Theory · Computer Science 2007-07-13 Alexandre Graell i Amat , Fredrik Brannstrom , Lars K. Rasmussen

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…

Information Theory · Computer Science 2014-02-27 David Conti , Nigel Boston

In this study we determine the structure of reversible DNA codes obtained from skew cyclic codes. We show that the generators of such DNA codes enjoy some special properties. We study the structural properties of such family of codes and we…

Combinatorics · Mathematics 2017-03-31 Fatmanur Gursoy , Elif Segah Oztas , Irfan Siap

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

By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak…

Quantum Physics · Physics 2026-02-26 Jonas Eidesen

In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying…

Information Theory · Computer Science 2013-03-21 Giuliano G. La Guardia

The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two…

Rings and Algebras · Mathematics 2016-02-09 Somphong Jitman , Patanee Udomkavanich

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Representation Theory · Mathematics 2011-05-23 Jérémy Le Borgne

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…

Information Theory · Computer Science 2025-03-18 José Manuel Muñoz

Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit…

Quantum Physics · Physics 2007-07-13 Salah A. Aly , Andreas Klappenecker , Pradeep Kiran Sarvepalli

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first…

Information Theory · Computer Science 2013-09-06 Nian Li , Chunlei Li , Tor Helleseth , Cunsheng Ding , Xiaohu Tang

In this article we construct a new family of semifields, containing and extending two well-known families, namely Albert's generalised twisted fields and Petit's cyclic semifields (also known as Johnson-Jha semifields). The construction…

Combinatorics · Mathematics 2019-09-11 John Sheekey

Neural codes serve as a language for neurons in the brain. Convex codes, which arise from the pattern of intersections of convex sets in Euclidean space, are of particular relevance to neuroscience. Not every code is convex, however, and…

Combinatorics · Mathematics 2017-05-31 Joshua Cruz , Chad Giusti , Vladimir Itskov , Bill Kronholm

Recently, rate-$1/\omega$ zero-terminated and tail-biting convolutional codes (ZTCCs and TBCCs) with cyclic-redundancy-check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short…

Information Theory · Computer Science 2022-06-09 Wenhui Sui , Hengjie Yang , Brendan Towell , Ava Asmani , Richard D. Wesel