Results 11 to 20 of about 640,608 (278)
Galois self-dual constacyclic codes [PDF]
Key words: Constacyclic code, Galois inner product, $q$-coset function, isometry, Galois self-dual ...
Fan, Yun, Zhang, Liang
openaire +2 more sources
Hermitian Self-Dual Abelian Codes [PDF]
Hermitian self-dual abelian codes in a group ring Fq2[G], where Fq2 is a finite field of order q2 and G is a finite abelian group, are studied. Using the well-known discrete Fourier transform decomposition for a semisimple group ring, a characterization of Hermitian self-dual abelian codes in Fq2[G] is given, together with an alternative proof of ...
Jitman, Somphong +2 more
openaire +2 more sources
Self-Dual and Complementary Dual Abelian Codes over Galois Rings [PDF]
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications.
Jitman, Somphong, Ling, San
core +3 more sources
What is self-plagiarism? [PDF]
In today's era of heightened sensitivity to plagiarism, self-plagiarism is gaining recognition as a distinct ethical concern within the global academic community.
Jovanović Miodrag
doaj +1 more source
Self-Dual 2-Quasi Abelian Codes
A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to be asymptotically good provided $-1$ is a square in $F$. Moreover, a kind of self-orthogonal quasi-abelian codes of
Liren Lin, Yun Fan
openaire +2 more sources
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
Binary self-dual codes and additive self-dual codes over GF(4) contain common points. Both have Type I codes and Type II codes, as well as shadow codes. In this paper, we provide a comprehensive description of extremal and near-extremal Type I codes over
Sunghyu Han
doaj +1 more source
Linear programming bounds for doubly-even self-dual codes [PDF]
Using a variant of linear programming method we derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives d/n
Ilia Krasikov, Simon Litsyn
core +3 more sources
Neighborhoods of Binary Self-Dual Codes
In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length. Further, we give some new necessary conditions for the existence of a singly-even (56,28,12)-code and a doubly-even (72,36,16)-code.
Carolin Hannusch, S. Roland Major
openaire +2 more sources
Extended binary Golay codes by a group algebra of one group
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary self-dual codes with Hamming distance between arbitrary codewords which are multiples of 4 that has the highest possible minimum Hamming distance among ...
М. Ю. Бортош +1 more
doaj +1 more source
Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A. +1 more
doaj +1 more source

