Results 1 to 10 of about 153,643 (269)
Entanglement-Assisted Quantum Codes from Cyclic Codes [PDF]
Entropy, 2022 Entanglement-assisted quantum-error-correcting (EAQEC) codes are quantum codes which use entanglement as a resource. These codes can provide better error correction than the (entanglement unassisted) codes derived from the traditional stabilizer ...
Francisco Revson F. Pereira +1 more
doaj +2 more sources
IEEE Transactions on Information Theory, 2011 In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. 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 F_q^n.
Braun, Michael +3 more
core +4 more sources
Quasi-cyclic subcodes of cyclic codes [PDF]
SIAM Journal on Discrete Mathematics, 2016 We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent
Belfiore, Jean-Claude +2 more
core +8 more sources
On Quasi-Cyclic Codes of Index 3 [PDF]
EntropyQuasi-cyclic codes of index 3 over finite fields are studied. We give a classification of such codes. Their duals with respect to the Euclidean and Hermitian inner products are investigated.
Kanat Abdukhalikov, Rasha M. Shat
doaj +2 more sources
Cyclic Sieving for cyclic codes [PDF]
Finite Fields and Their Applications, 2021 Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain cyclic codes. For example, it is shown that, among dual Hamming codes over $F_q$, the generating function for codedwords according to the major index statistic (resp. the inversion statistic) gives rise to a CSP when $q=2$ or $q=3$ (resp. when $q=2$).
Mason, Alex +2 more
openaire +2 more sources
New DNA Codes from Cyclic Codes over Mixed Alphabets
Mathematics, 2020 Let R=F4+uF4,withu2=u and S=F4+uF4+vF4,withu2=u,v2=v,uv=vu=0. In this paper, we study F4RS-cyclic codes of block length (α,β,γ) and construct cyclic DNA codes from them. F4RS-cyclic codes can be viewed as S[x]-submodules of Fq[x]〈xα−1〉×R[x]〈xβ−1〉×S[x]〈xγ−
Hai Q. Dinh +3 more
doaj +1 more source
Describing a cyclic code by another cyclic code [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a second cyclic code to the original one and bound its minimum distance in terms of parameters of the associated code.
Zeh, Alexander, Bezzateev, Sergey
openaire +2 more sources
Construction of reversible cyclic codes over 𝔽q + u𝔽q + u2𝔽q
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = 𝔽q +u𝔽q + u2𝔽q, where u3 = 0 mod q.
Rehman Nadeem ur +2 more
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2005 We characterize degenerate cyclic codes and study their properties.
Gintaras Skersys
doaj +3 more sources
On quasi-cyclic codes and traces of codes
Lietuvos Matematikos Rinkinys, 2004 There is not abstract.
Gintaras Skersys
doaj +3 more sources