ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Literature
Languages
Psychology
Research
Technology
Architecture and Urbanism
Economy
Religion
all records (75)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Brazil
South Africa
Ukraine
Canada
Spain
Australia
Turkey, Turkish Republic
Italy
all records (75)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
52.038  Articles
1 of 5.205 pages  |  10  records  |  more records»
The DNA molecule chain consists of two complementary strands composed of a sequence of four nucleotide bases, namely adenine (A), cytosine (C), guanine (G) and thymine (T). DNA code is a set of codewords with a fixed length of the alphabet {A, C, T, G}. D... see more

In this work, we generalize the four circulant construction for self-dualcodes. By applying the constructions over the alphabets F_2, F_2+uF_2, F_4+uF_4, we were able to obtain extremal binary self-dual codes of lengths 40, 64 including new extremal binar... see more

A linear code over a finite field is called Hermitian self-dual if the code is self-dual under the Hermitian inner-product. The Hermitian self-dual code is called MDS or near-MDS if the code attains or almost attains the Singleton bound. In this paper we ... see more

In this work, construction methods for formally self-dual codes are generalized in the form of block lambda-circulant matrices. The constructions are applied over the rings F_2,R1 = F_2 + uF_2 and S = F_2[u]=(u^3-1). Using n-block lambda-circulant matrice... see more

In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 + uF_2 and self-du... see more

This paper deals with the study and construction of self-dual codes equipped with Rosenbloom-Tsfasman metric (RT-metric, in short). An [s, k] linear code in RT-metric over Fq has codewords with k different non-zero weights. Using the generator matrix in s... see more

In this paper we study optimal binary self-dual codes with minimum distance 12 having an automorphism of order 17. We prove that all such codes have parameters [68 + f; 34 + f=2; 12]; f = 0; 2; 4 and automorphism of type 17- (4; f), f = 0; 2; 4 and provid... see more

We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs.The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codeshave large automorphism groups, they are suitable for permutation deco... see more

This article discusses linear complementary dual (LCD) codes over R = Fq+uFq(u2=1) where q is a power of an odd prime p. Authors come up with a new Gray map from Rn to F2nq and define a new class of codes obtained as the gray image of const... see more

1 of 5.205 pages  |  10  records  |  more records»