相关论文: Convolutional Codes of Goppa Type
Multidimensional convolutional codes generalize (one dimensional) convolutional codes and they correspond under a natural duality to multidimensional systems widely studied in the systems literature.
This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…
New families of unit memory as well as multi-memory convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator…
We introduce Generalized Skew Multivariate Goppa codes relying on the theory of multivariate Ore polynomials. These codes contain, as a particular case, the Generalized Skew Goppa codes. By providing a new parity check matrix for the…
After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used…
Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This…
Maximum distance separable convolutional codes are the codes that present best performance in error correction among all convolutional codes with certain rate and degree. In this paper, we show that taking the constant matrix coefficients…
Generalized Goppa codes are defined by a code locator set $\mathcal{L}$ of polynomials and a Goppa polynomial $G(x)$. When the degree of all code locator polynomials in $\mathcal{L}$ is one, generalized Goppa codes are classical Goppa…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…
In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of…
We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of…
In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
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…
We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable…
This paper presents a large-scale computational study on the dimensional properties of twisted Goppa codes. Through the systematic analysis of over 50,000 parameter sets, we uncover a remarkable deterministic regularity: the actual…
MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…
Differential Convolutional Codes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson-Gorenstein-Zierler's algorithm, is designed for them.
In this paper, we introduce multivariate Goppa codes, which contain as a special case the well-known, classical Goppa codes. We provide a parity check matrix for a multivariate Goppa code in terms of a tensor product of generalized…
A general method for constructing convolutional codes from units in Laurent series over matrix rings is presented. Using group ring as matrix rings, this forms a basis for in-depth exploration of convolutional codes from group ring…