Results 21 to 30 of about 3,023,466 (332)
Minimum survivable graphs with bounded distance increase [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study in graphs properties related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increases by more than k. In the
Selma Djelloul, Mekkia Kouider
doaj +2 more sources
The [72,36] Type 11 Self Dual Codes from Hadamard Matrices
Davao Research Journal, 2001 Consider a code [n,k,d] of length n, dimension k and of minimum distance d. Let R be a rate defined by the equation R = k/n. Mathematically, the main problem of coding theory is to find codes with large R (for efficiency) and large d (to correct many ...
Rowena Baylon-Cabrizos
doaj +1 more source
Group codes over symmetric groups
AIMS Mathematics, 2023 Let $ \Bbb F_{q} $ be a finite field of characteristic $ q $ and $ S_n $ a symmetric group of order $ n! $. In this paper, group codes in the symmetric group algebras $ \Bbb F_{q}S_n $ with $ q > 3 $ and $ n = 3, 4 $ are proposed.
Yanyan Gao , Yangjiang Wei
doaj +1 more source
Dihedral Codes with Prescribed Minimum Distance [PDF]
, 2021 Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the
Borello, Martino, Jamous, Abdelillah
openaire +4 more sources
A moment-distance hybrid method for estimating a mixture of two symmetric densities
Modern Stochastics: Theory and Applications, 2018 In clustering of high-dimensional data a variable selection is commonly applied to obtain an accurate grouping of the samples. For two-class problems this selection may be carried out by fitting a mixture distribution to each variable.
David Källberg +2 more
doaj +1 more source
Generalized minimum distance functions [PDF]
Journal of Algebraic Combinatorics, 2018 J. Algebraic Combin., to appear.
González-Sarabia, Manuel +3 more
openaire +2 more sources
Geoid, 2015 Wilayah pesisir dan lautan merupakan salah satu sumber daya alam yang mempunyai sifat yang kompleks dan dinamis karena pengaruh dari dua ekosistem, yaitu ekosistem lautan dan daratan.
Latri Wartika, Teguh Hariyanto
doaj +1 more source
Twisted Permutation Codes [PDF]
, 2014 We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a lower bound for
Gillespie, Neil I. +2 more
core +4 more sources
Minimum distance-unbalancedness of trees [PDF]
Journal of Mathematical Chemistry, 2021 AbstractFor a graph G, and two distinct vertices u and v of G, let $$n_{G}(u,v)$$ n G ( u , v )
Kramer, Marie, Rautenbach, Dieter
openaire +2 more sources
Parameterized Codes over Cycles
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2013 In this paper we will compute the main parameters of the parameterized codes arising from cycles. In the case of odd cycles the corresponding codes are the evaluation codes associated to the projective torus and the results are well known. In the case of
González Sarabia Manuel +3 more
doaj +1 more source