Results 11 to 20 of about 641,465 (260)
Entropy, 2020 In this paper, we obtain upper bounds on the minimum distance for turbo codes using fourth degree permutation polynomial (4-PP) interleavers of a specific interleaver length and classical turbo codes of nominal 1/3 coding rate, with two recursive ...
Lucian Trifina +3 more
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
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
Generalized minimum distance functions [PDF]
Journal of Algebraic Combinatorics, 2018 J. Algebraic Combin., to appear.
Manuel González Sarabia +3 more
openaire +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
DEGREE DISTANCE AND MINIMUM DEGREE [PDF]
Bulletin of the Australian Mathematical Society, 2012 AbstractLet G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u+deg v) d(u,v), where deg w is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order,
Mukwembi, S., Munyira, S.
openaire +2 more sources
Minimum distance and the minimum weight codewords of Schubert codes
Finite Fields and Their Applications, 2018 26 pages; Slightly revised version; to appear in Finite Fields ...
Sudhir R. Ghorpade, Prasant Singh
openaire +4 more sources
The Minimum Distance of Graph Codes [PDF]
, 2011 We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries.
Høholdt, Tom, Justesen, Jørn
openaire +1 more source
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
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