(28, 12, 11) [117]. (31, 10, 3) [34]. (36, 16, 12) [117]. (49, 9, 6) [142]. (64, 2, 12) [236]. (Ck ⊕G,k, 1) [251]. (G, k, 1) [251]. (m,n) [151]. (m− 1)/pm [167]. (p, p, p, p) [139]. (q, 6, 1) [342]. (v, {2, 4}, 1) [245]. (v, k, λ) [109]. −1 [26]. 0 [102, 205]. {0, 1, 2} [101]. 1 [205]. 15 [102]. 2 [14, 36, 55, 61, 68, 86, 117, 142, 143, 223, 265, 266, 271, 296, 324]. 25 [302]. 27 [93, 120]. 28 ...

Let [n, k, d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF (q). In this paper, the existence of the next recordbreaking codes [35, 7, 23]9, [42, 7, 29]9, [49, 7, 34]9, [56, 7, 40]9, [63, 7, 46]9, [98, 7, 75]9, [105, 7, 81]9, [112, 7, 87]9, [119, 7, 93]9, [126, 7, 99]9, [133, 7, 105]9, [48, 8, 32]9, [56, 8, 39]9, [104, 8, 78]9, [112, 8, 85]9, [120, 8, 91...

Grain quality currently represents a major problem in high yielding rice production in Iran and many other rice producing areas of the world. Quality assessment of rice involves the function of sensory tests and physicochemical determinations based on the chemical composition, cooking quality, gelatinization temperature and physical properties of cooked rice. These research genetic materials we...

This paper presents a system for the automatic generation of Galois-field (GF) arithmetic circuits, named the GF Arithmetic Module Generator (GF-AMG). The proposed system employs a graph-based circuit description called the GF Arithmetic Circuit Graph (GF-ACG). First, we present an extension of the GF-ACG to handle GF(pm) (p ≥ 3) arithmetic circuits, which can be efficiently implemented by mult...

We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity...

Elliptic curve cryptography (ECC) is popularly defined either over GF(p) or GF(2 k). This research modifies a GF(p) multiplication algorithm to make it applicable for GF(2 k). Both algorithms, the GF(p) and GF(2 k) one, are designed in hardware to be compared. The GF(2 k) multiplier is found faster and small. This GF(2 k) multiplier is further improved to benefit in speed, it gained more than 4...

In South-East Asian dipterocarp forests, many trees synchronize their reproduction at the community level, but irregularly, in a phenomenon known as general flowering (GF). Several proximate cues have been proposed as triggers for the synchronization of Southeast Asian GF, but the debate continues, as many studies have not considered geographical variation in climate and flora. We hypothesized ...

This paper gives new methods of constructing symmetric self-dual codes over a finite field GF(q) where q is power an odd prime. These are motivated by the well-known Pless symmetry and quadratic double circulant codes. Using these methods, we construct amount GF(11), GF(19), GF(23) every length less than 42. We also find 153 up to equivalence: they [32, 16, 12], [36, 18, 13], [40, 20, 14] 15] 1...