Results 221 to 230 of about 1,786 (232)

Packing problems in Galois geometries over GF(3)

Geometriae Dedicata, 1978
A set of kind s in the Galois space Sr,q is a set of points such that any s+1 are linearly independent but there is at least one subset of s+2 The packing problem is that of finding , the largest size of kind s in Sr,q. The main result is the evaluation of for all s⩽r⩽5. linearly dependent points. Some partial results bounding ms6,3 are also given.
openaire   +1 more source

Properties of fastest linearly independent transforms over GF(3)

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512), 2004
Fastest linearly independent transforms over GF(3) have been investigated recently. This paper introduces new class of fastest transforms and discusses their various properties and relations. Experimental results for the fastest linearly independent transforms are compared with ternary Reed-Muller transform using ternary benchmark functions.
B.J. Falkowski, null Cheng Fu
openaire   +1 more source

Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition

2008
The ηTpairing in characteristic threeis implemented by arithmetic in GF(3)={0,1,2}. Harrison et al.reported an efficient implementation of the GF(3)-addition by usingseven logical instructions (consisting of AND, OR, and XOR) withthe two-bit encoding { (0,0) →0, (0,1) →1, (1,0) → 2}.
Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi   +2 more
openaire   +1 more source

CLASSIFICATION OF NEW LINEARLY INDEPENDENT TRANSFORMS OVER GF(3)

Journal of Circuits, Systems and Computers, 2005
New classes of ternary linearly independent transforms as the bases of ternary polynomial expansions over GF(3) are introduced here. Recursive equations defining the linearly independent transforms and their corresponding butterfly diagrams are shown.
BOGDAN J. FALKOWSKI, CHENG FU
openaire   +1 more source

Recognition of the projective special linear group over GF(3)

Acta Mathematica Sinica, English Series, 2010
Let \(G\) be a finite group and denote by \(\omega(G)\) the set of its element orders. \(G\) is called \(k\)-recognizable if up to isomorphism there are \(k\) groups \(H\) with the property \(\omega(G)=\omega(H)\). In this paper the author proves that the group \(\text{PSL}_p(3)=L_p(3)\), where \(p>3\) is a prime number, is at most \(2\)-recognizable ...
openaire   +2 more sources

?????????????????? ?? ???????????????? ?????????? ?????????????????? ?????????????? ??????????????????? ???????????????????? ?????????????? ???????????????? ???????????????????? ?????????????? ?????? ?????????? GF(3)

2010
Two theorems on the conditions of existence of the unique solution depending on intervals of the distribution of coefficients of the system are proved for a homogeneous system of linear random equations over the field GF(3).
openaire   +1 more source

?????????????? ???????????????????????????? ?????????????? ???????????????????????? ?????????????? ???????????????????? ?????????????????? ?????????????????? ?????? ?????????? GF(3)

2013
An inhomogeneous simultaneous system of second-order nonlinear random equations over a field consisting of three elements is considered. A necessary and sufficient condition for the system to have a unique solution in a given set of n-dimensional vectors for n n ??? ???
openaire   +1 more source

GF-3 photoelectric hemoglobinometer

Biomedical Engineering, 1978
F. S. Nakalov, Z. A. Dement'eva, V. D. Ozerov   +2 more
openaire   +1 more source

[Photoelectric hemoglobinometer GF-3].

Meditsinskaia tekhnika, 1978
F S, Nakalov, Z A, Dement'eva, V D, Ozerov   +2 more
openaire   +1 more source

Regular Polygons Over GF[ 3 2 ]

The American Mathematical Monthly, 1961
openaire   +1 more source