Results 41 to 50 of about 513,670 (123)
The Galois variance of constacyclic codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
A class of constacyclic codes over a finite field [PDF]
Let Fq be a finite field with q=pm elements, where p is an odd prime and m⩾1. In this paper, we explicitly determine all the μ-constacyclic codes of length 2n over Fq, when the order of μ is a power of 2.
Gurmeet K. Bakshi +3 more
core +1 more source
Z 4 Z 4 [u]-ADDITIVE CYCLIC AND CONSTACYCLIC CODES
International audienceWe study mixed alphabet cyclic and constacyclic codes over the two alphabets Z 4 , the ring of integers modulo 4, and its quadratic extension Z 4 [u] = Z 4 + uZ 4 , u 2 = 0.
Prakash, Om +2 more
core +1 more source
Quasi-twisted codes with constacyclic constituent codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minjia Shi, Yiping Zhang
openaire +3 more sources
A class of constacyclic codes from group algebras
Constacyclic codes are preferred in engineering applications due to their efficient encoding process via shift registers. The class of constacyclic codes contains cyclic and negacyclic codes.
Mehmet Koroglu +3 more
core +1 more source
A class of constacyclic codes are generalized Reed-Solomon codes
Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed-Solomon (GRS) codes. The square $\mathcal{C}^{2}$ of a linear
Liu, Hongwei, Liu, Shengwei
core
Equivalence of constacyclic codes with shift constants of different orders [PDF]
Let $a$ and $b$ be two non-zero elements of a finite field $\mathbb{F}_q$, where $q>2$. It has been shown that if $a$ and $b$ have the same multiplicative order in $\mathbb{F}_q$, then the families of $a$-constacyclic and $b$-constacyclic codes over ...
Grassl, Markus +4 more
core +1 more source
Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach [PDF]
We characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes and characterize
Garani, Shayan Srinivasa, Patel, Shikha
core +1 more source
A note on the duals of skew constacyclic codes
Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $θ: \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with skew constacyclic codes, that is, linear codes of $\mathbb{F}_q^n$ which are invariant under the action of a semi-linear map $Φ_{α,θ}:\mathbb{F}_q^n\to\mathbb{F}_q^n$, defined by $Φ_{α,θ ...
Alexis Eduardo Almendras Valdebenito +1 more
openaire +2 more sources
A locally recoverable code (for brevity LRC) is a code such that a symbol in any coordinate of a codeword can be repaired by using the symbols in at most r other positions. These codes are used in distributed storage systems by Microsoft Azure and Hadoop
Köroğlu, Mehmet Emin, Zengin, Rabia
core

