Results 11 to 20 of about 27,942 (261)
An equivalence between network coding and index coding [PDF]
We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and non-linear codes. Specifically, we present an efficient reduction that maps a network coding instance to an index coding one while preserving feasibility.
Effros, Michelle +2 more
openaire +4 more sources
On the Equivalence of Interleavers for Turbo Codes [PDF]
Three of the most common interleavers for turbo codes (TCs) are dithered relative prime (DRP) interleavers, quadratic permutation polynomial (QPP) interleavers, and almost regular permutation (ARP) interleavers. In this paper, it is shown that DRP and QPP interleavers can be expressed in the ARP interleaver function form.
Garzon Bohorquez, Ronald +2 more
openaire +3 more sources
On bounded linear codes and the commutative equivalence
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carpi A., D'Alessandro F.
openaire +4 more sources
A generalization of cyclic code equivalence algorithm to constacyclic codes
Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes. As an application of the algorithm we found many constacyclic codes with good parameters and properties. In particular, we found 23 new codes that improve
Dev Akre +3 more
openaire +2 more sources
The equivalence of linear codes implies semi-linear equivalence
We prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are additively equivalent.
Ball, Simeon Michael, Dixon, James
openaire +4 more sources
Characters and the equivalence of codes
Let \(K\) be a finite field. A linear code of dimension \(k\) and block length \(n\) is a \(k\)-dimensional \(K\)-linear subspace \(C\) of the \(n\)-dimensional vector space \(K^n\) over \(K\). Two linear codes \(C_1\) and \(C_2\) in \(K^n\) are equivalent if there exists a monomial transformation \(T: K^n\to K^n\) such that \(T(C_1)= C_2 ...
Harold N. Ward, Jay A. Wood
openaire +2 more sources
The equivalence of GRS codes and EGRS codes
Generalized Reed-Solomon and extended generalized Reed-Solomon (abbreviation to GRS and EGRS) codes are the most well-known family of MDS codes with wide applications in coding theory and practice. Let $\mathbb{F}_q$ be the $q$ elements finite field, where $q$ is the power of a prime.
openaire +2 more sources
On linear equivalence and Phelps codes
It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.
Olof Heden, Martin Hessler
openaire +1 more source
ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for equivalence of linear codes, based on their relation to multisets of points in a projective geometry.
Iliya Bouyukliev, Stefka Bouyuklieva
openaire +2 more sources
La narrativa de código mixto de Cisneros y sus implicaciones para la traducción
Las consecuencias pragmáticas de la alternancia de código en el campo de la traducción literaria han sido poco estudiadas, especialmente en el caso de las novelas chicanas escritas en inglés, pero que alternan al español por razones estilísticas ...
María José García Vizcaíno
doaj +1 more source

