相关论文: Strongly MDS Convolutional Codes
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…
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…
We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight…
Maximum distance profile (MDP) convolutional codes have been proven to be very suitable for transmission over an erasure channel. In addition, the subclass of complete MDP convolutional codes has the ability to restart decoding after a…
In this paper, we introduce codes equipped with pomset block metric. A Singleton type bound for pomset block codes is obtained. Code achieving the Singleton bound, called a maximum distance separable code (for short, MDS…
In this article we prove Griesmer type bounds for additive codes over finite fields. These new bounds give upper bounds on the length of maximum distance separable (MDS) codes, codes which attain the Singleton bound. We will also consider…
Maximum distance separable (MDS) codes are very important in both theory and practice. There is a classical construction of a family of $[2^m+1, 2u-1, 2^m-2u+3]$ MDS codes for $1 \leq u \leq 2^{m-1}$, which are cyclic, reversible and BCH…
In modern storage technologies, symbol-pair codes have emerged as a crucial framework for addressing errors in channels where symbols are read in overlapping pairs to guard against pair errors. A symbol-pair code that meets the…
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible for given rate and degree. There exists a well-known criterion to check whether a code is MDP using the generator or…
Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of…
We define a new class of Convolutional Codes in terms of fibrations of algebraic varieties generalizaing our previous constructions of Convolutional Goppa Codes. Using this general construction we can give several examples of Maximum…
In the last decade there has been a great interest in extending results for codes equipped with the Hamming metric to analogous results for codes endowed with the rank metric. This work follows this thread of research and studies the…
A linear code with parameters $[n,k,n-k]$ is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum distance separable (NMDS for short) code. NMDS codes have…
Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…
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…
An $[n, k, n-k+1]$ linear code is called an MDS code. An $[n, k, n-k]$ linear code is said to be almost maximum distance separable (almost MDS or AMDS for short). A code is said to be near maximum distance separable (near MDS or NMDS for…
Convolutional codes with a maximum distance profile attain the largest possible column distances for the maximum number of time instants and thus have outstanding error-correcting capability especially for streaming applications. Explicit…
The free distance of a convolutional code is a reliable indicator of its performance. However its computation is not an easy task. In this paper, we present some algorithms to compute the free distance with good efficiency that work for…
MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…