Results 11 to 20 of about 35,710 (296)
On quasi-cyclic codes as a generalization of cyclic codes [PDF]
Finite Fields and Their Applications, 2012 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 +7 more sources
IEEE Transactions on Information Theory, 2013 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 +5 more sources
Design of LDPC Codes: A Survey and New Results [PDF]
Journal of Communications Software and Systems, 2006 This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining(near-)optimal degree distributions for LDPC code ensembles.
Gianluigi Liva +5 more
doaj +3 more sources
Quasi-cyclic codes with cyclic constituent codes [PDF]
Finite Fields and Their Applications, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lim, Chong Jie
openaire +2 more sources
Classification of Certain Cyclic LCD Codes [PDF]
Scientific Annals of Computer ScienceWe show that a necessary and sufficient condition for a cyclic code C of length N over a finite chain ring R (whose maximal ideal has nilpotence 2) to be an LCD code is that C = (f(x)), where f(X) is a self-reciprocal monic divisor of X^N − 1 in R[X] and
Seth Gannon, Hamid Kulosman
doaj +2 more sources
Information and Control, 1977 Using results on linear recurring sequences the author gives an inequality for the weight of the nonzero codewords of cyclic codes. In the case of cyclic codes with parity-check polynomial without multiple roots a refined inequality is proved. For certain binary cyclic codes the exact weight distribution can be determined.
Niederreiter, Harald
openaire +3 more sources
Lietuvos Matematikos Rinkinys, 2005 We characterize degenerate cyclic codes and study their properties.
Gintaras Skersys
doaj +3 more sources
Cyclic and Convolutional Codes With Locality [PDF]
IEEE Transactions on Information Theory, 2021 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
On quasi-cyclic codes and traces of codes
Lietuvos Matematikos Rinkinys, 2004 There is not abstract.
Gintaras Skersys
doaj +3 more sources
CoRR, 2020 arXiv admin note: text overlap with arXiv:1906 ...
Güneri, Cem, Ling, San, Özkaya, Buket
openaire +4 more sources