Results 11 to 20 of about 1,469,827 (288)
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 +6 more sources
Equivalent-Capacity-Based Design of Space-Time Block-Coded Sphere-Packing-Aided Multilevel Coding [PDF]
A multilevel coding (MLC) scheme invoking sphere packing (SP) modulation combined with space time block coding (STBC) is designed. The coding rates of each of the MLC component codes are determined using the so-called equivalent capacity based ...
Ng, S.X. +7 more
core +2 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 +4 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
psp-codes/adaptive-conformation-sampling: Public Release
This is the public release of the codes for the project detailed in the manuscript titled "Adaptive Stochastic Optimization to Improve Protein Conformation Sampling".
psp-codes
core +1 more source
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 +3 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 +6 more sources
Short Low-Rate Non-Binary Turbo Codes [PDF]
A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields.
Paolini, Enrico +9 more
core +1 more source
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 +3 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 +3 more sources

