Results 11 to 20 of about 163,262 (305)
Cyclicity of Binary Group Codes [PDF]
In this paper, we study the cyclicity of binary group codes, identifying them as ideals in a group algebra. We focus on the construction of ω|ω¯ codes, proving that they are self-dual group codes over the abelian group C2×Ck. We demonstrate that for even
Beatriz García García +2 more
doaj +2 more sources
Development of International Classification of Diseases crosswalks using text analysis methods. [PDF]
Objective To evaluate the performance of a natural language processing (NLP) method to develop an automated crosswalk between the 9th and 10th revisions of the International Classification of Diseases (ICD) for diagnosis codes in the Charlson ...
Joykrishna Sarkar, Lisa Lix
doaj +2 more sources
The equivalence of codes [PDF]
When discussing equivalent codes, the literature tends to define equivalence differently for linear or nonlinear codes. For non-linear codes, one normally defines equivalence based on a permutation of coordinates and permutations of the code alphabet on each coordinate.
Dixon, James Edward
core +3 more sources
Enumeration of Optimal Equidistant Codes
Problems of search and enumeration of binary and ternary equidistant codes are considered in the paper. We investigate some combinatorial algorithms and develop specialized computer packages to find non-equivalent optimal binary and ternary equidistant ...
Galina Bogdanova, Todor Todorov
doaj +1 more source
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
Denk Kodlar Arasındaki Permütasyonu Bulmak
McEliece sistemi [1] gibi bazı şifreleme sistemlerinde denk kodlar kullanılmaktadır ve bu sistemlerin güvenliği verilen iki kodun denk olup olmadığının tespitine ve eğer denk iseler aralarındaki permütasyonun bulunmasının zorluğuna dayanmaktadır [2].
Ekrem EMRE
doaj +6 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

