Related papers: One dimensional Convolutional Goppa Codes over the…
We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing…
The central objective of this dissertation was to present the Goppa Geometry Codes via elementary methods which were introduced by J.H. van Lint ,R.Pellikaan and T. Hohold about 1998. On the first part of such dissertation are presented the…
In the recent paper entitled "Explicit constructions of MDS self-dual codes" accepted in { IEEE Transactions on Information Theory}, doi: 10.1109/TIT.2019.2954877, the author has constructed families of MDS self-dual codes from genus zero…
In this paper, we construct new sequences of asymptotically good convolutional codes. These sequences are obtained from sequences of transitive, self-orthogonal and self-dual block codes that attain the Tsfasman-Vladut-Zink bound.…
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…
On a Goppa code whose structure polynomial has coefficients in the symbol field, the Frobenius acts. Its fixed codewords form a subcode. Deleting the naturally occurred redundance, we obtain a new code. It is proved that these new codes…
This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general…
Dorff, proved in [2] that the convolution of two harmonic right-half plane mappings is convex in the direction of real axis provided that the convolution is locally univalent and sense preserving. Later, it was shown in [3] that the…
In this paper, we prove that the Gauss--Picard modular group PU(3,1;Z[i])in three complex dimensions can be generated by five given transformations: two Heisenberg translations, two Heisenberg rotations and an involution. Indeed, our method…
In more than one spatial dimension, resonant linear conversion from one wave type to another can have a more complex geometry than the familiar 'avoided crossing' of one-dimensional problems. In previous work we have shown that helical ray…
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…
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…
We introduce $\omega$-catoids as generalisations of (strict) $\omega$-categories and in particular the higher path categories generated by computads or polygraphs in higher-dimensional rewriting. We also introduce $\omega$-quantales that…
Observable convolutional codes defined over Zpr with the Predictable Degree Property admit minimal input/state/output representations that preserve structural properties under scalar restriction. We make use of this fact to present…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can…
Decoding of convolutional codes poses a significant challenge for coding theory. Classical methods, based on e.g. Viterbi decoding, suffer from being computationally expensive and are restricted therefore to codes of small complexity. Based…
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…
The operator definition of generalised transverse-momentum-dependent (GTMD) distributions is exploited to compute for the first time the full set of one-loop corrections to the off-forward matching functions. These functions allow one to…