Results 211 to 220 of about 21,563 (256)
The Minimum Distance of Parameterized Codes on Projective Tori [PDF]
Applicable Algebra in Engineering, Communications and Computing, 2011 Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus.
Maria Vaz Pinto +2 more
exaly +3 more sources
Parameterized Affine Codes [PDF]
Studia Scientiarum Mathematicarum Hungarica, 2012 Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials. We give an algebraic method, using Gröbner bases, to compute the length and the dimension of CX* (d), the parameterized affine code of degree d on the set X*.
Rafael Heraclio Villarreal +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Generalized Hamming Weights and Some Parameterized Codes
Discrete Mathematics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manuel González Sarabia +1 more
exaly +3 more sources
A Parameterized g-Code Compiler for Scaffolds 3D Bioprinting
Bioprinting, 2022Ingri Julieth Mancilla Corzo +2 more
exaly +2 more sources
Parameteric coding of speech signals
2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009In this paper an FS1015 LPC coder has been designed using Matlab to produce intelligible speech. This paper focuses on the different methods of implementation and compared to determine, which gives the best performance. The coder has been tested on Hindi.
Vivek Kumar Sehgal +5 more
openaire +2 more sources
Source Code Modification Technology Based on Parameterized Code Patterns
2010 6th Central and Eastern European Software Engineering Conference (CEE-SECR), 2010Source code modification is one of the most frequent operations which developers perform in software life cycle. Such operation can be performed in order to add new functionality, fix bugs or bad code style, optimize performance, increase readability, etc. During the modification of existing source code developer needs to find parts of code, which meet
Vladimir Itsykson
exaly +2 more sources
Parameterized Codes Associated to the Edges of Some Subgraphs of a Simple Graph
Applicable Algebra in Engineering, Communications and Computing, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eliseo Sarmiento +1 more
exaly +4 more sources
Flexible Parameterization of XOR based Codes for Distributed Storage
2008 Seventh IEEE International Symposium on Network Computing and Applications, 2008Distributed storage systems apply erasure-tolerant codes to guarantee reliable access to data despite failures of storage resources. While many codes can be mapped to XOR operations and efficiently implemented on common microprocessors, only a certain number of codes are usually implemented in a certain system (out of a wide variety of different codes).
Peter Sobe, Kathrin Peter
openaire +2 more sources
Simplifying the Parameterization of Real-Coded Evolutionary Algorithms
Critical Transitions in Water and Environmental Resources Management, 2004This paper demonstrates how existing parameterization techniques for binary coded genetic algorithms can be extended to real -coded evolutionary algorithms. An easy-to-implement framework for automating parameter setting for real -coded evolutionary algorithms is demonstrated in this study using Differential Evolution (DE), a real -coded evolutionary ...
Patrick M. Reed, Satoshi Yamaguchi
openaire +1 more source
Algebraic Methods for Parameterized Codes and Invariants of Vanishing Ideals Over Finite Fields
Finite Fields and Their Applications, 2011 Let K be a finite field with q elements and let X be a subset of a projective space P^{s-1}, over the field K, which is parameterized by Laurent monomials. Let I(X) be the vanishing ideal of X. Some of the main contributions of this paper are in determining the structure of I(X) and some of their invariants. It is shown that I(X) is a lattice ideal. We
Rafael Heraclio Villarreal +2 more
exaly +5 more sources