Results 1 to 10 of about 4,907,516 (322)
Cyclicity of Binary Group Codes [PDF]
EntropyIn 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
Enumeration of Optimal Equidistant Codes
Mathematics, 2022 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]
2013 IEEE International Symposium on Information Theory, 2013 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
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2014 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]
IEEE Wireless Communications Letters, 2015 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
Theoretical Computer Science, 2021 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
Designs, Codes and Cryptography, 2022 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
Designs, Codes and Cryptography, 2022 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
Revista IBRACON de Estruturas e Materiais, 2021 In the last decades, several studies have been developed regarding structures composed by frames infilled with masonry walls, proving the increase of lateral stiffness by the infill.
Alba Bruna Cintra De Grandi +5 more
doaj +1 more source
Characters and the equivalence of codes
Journal of Combinatorial Theory, Series A, 1996 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