Results 11 to 20 of about 642,415 (277)
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 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
Self-Dual and Complementary Dual Abelian Codes over Galois Rings [PDF]
, 2019 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
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
Information, 2018 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
Extended binary Golay codes by a group algebra of one group
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2020 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
Self-Dual 2-Quasi Abelian Codes
IEEE Transactions on Information Theory, 2022 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
Linear programming bounds for doubly-even self-dual codes [PDF]
, 1997 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
Contemporary Mathematics, 2023 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
Narain CFTs and error-correcting codes on finite fields
Journal of High Energy Physics, 2022 We construct Narain CFTs from self-dual codes on the finite field F p through even self-dual lattices for any prime p > 2. Using this correspondence, we can relate the spectral gap and the partition function of the CFT to the error correction capability ...
Shinichiro Yahagi
doaj +1 more source
On McEliece-Type Cryptosystems Using Self-Dual Codes With Large Minimum Weight
IEEE Access, 2023 One of the Round 3 Finalists in the NIST post-quantum cryptography call is the Classic McEliece cryptosystem. Although it is one of the most secure cryptosystems, the large size of its public key remains a practical limitation. In this work, we propose a
Luca Mariot +2 more
doaj +1 more source
On the Problem of the Existence of a Square Matrix U Such That UUT = −I over Zpm
Information, 2017 Building-up construction is one of several methods for constructing self-dual codes. Recently, a new building-up construction method has been developed by S.
Sunghyu Han
doaj +1 more source