Results 11 to 20 of about 672 (207)
A constant dimension code consists of a set of k-dimensional subspaces of Fqn. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all subspaces of Fqn. If the acting group is cyclic, the corresponding orbit codes are called cyclic orbit codes.
Anna-Lena Trautmann +3 more
openaire +3 more sources
We characterize degenerate cyclic codes and study their properties.
Gintaras Skersys
doaj +3 more sources
On quasi-cyclic codes and traces of codes
There is not abstract.
Gintaras Skersys
doaj +3 more sources
arXiv admin note: text overlap with arXiv:1906 ...
Güneri, Cem, Ling, San, Özkaya, Buket
openaire +4 more sources
Cyclic and Convolutional Codes With Locality [PDF]
An extended abstract of this work appears in Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT 2020)
Zitan Chen, Alexander Barg
openaire +2 more sources
In network coding, a flag code is a set of sequences of nested subspaces of $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on flags of $\mathbb{F}_q^n$ are called cyclic orbit flag codes.
Clementa Alonso-González +1 more
openaire +3 more sources
On cyclic DNA codes over the rings Z4 + wZ4 and Z4 + wZ4 + vZ4 + wvZ4
The structures of cyclic DNA codes of odd length over the finite ringsВ R = Z4 + wZ4, w^2 = 2 and S = Z4 + wZ4 + vZ4 + wvZ4; w^2 = 2; v^2 =v; wv = vw are studied.
Abdullah Dertli, Yasemin Cengellenmis
doaj +1 more source
On quasi-cyclic codes as a generalization of cyclic codes
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 codes of length m and ideals of M_l(Fq)[X]/(X^m-1).
Morgan Barbier +2 more
openaire +5 more sources
Quantum Codes Obtained From Constacyclic Codes Over a Family of Finite Rings Fp[u₁, u₂, …, us]
In this article, we construct some MDS quantum error-correcting codes (QECCs) from classes of constacyclic codes over Rs = Fp + u1Fp + ··· + usFp, ui2 = ui, uiuj = ujui = 0, for odd prime p and i, j = 1, 2,⋯, s, i ≠ j ...
Hai Q. Dinh +4 more
doaj +1 more source
On Cyclic Convolutional Codes [PDF]
50 ...
Gluesing-Luerssen, Heide +1 more
openaire +3 more sources

